Abstract
Whale Calf is a parser generator that uses conjunctive grammars, a generalization of context-free grammars with an explicit intersection operation, as the formalism of specifying the language. All existing parsing algorithms for conjunctive grammars are implemented — namely, the tabular algorithm for grammars in the binary normal form, the tabular algorithm for grammars in the linear normal form, the tabular algorithm for arbitrary grammars, the conjunctive LL, the conjunctive LR and the algorithm based on simulation of the automata equivalent to linear conjunctive grammars. The generated C++ programs can determine the membership of strings in the language and, if needed, create parse trees of these strings.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Graphviz-open source graph drawing software, available at http://www.research.att.com/sw/tools/graphviz/.
A. Okhotin, “Conjunctive grammars”, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519–535.
A. Okhotin, “Top-down parsing of conjunctive languages”, Grammars, 5:1 (2002), 21–40.
A. Okhotin, “A recognition and parsing algorithm for arbitrary conjunctive grammars”, to appear in Theoretical Computer Science.
A. Okhotin, “LR parsing for conjunctive grammars”, Grammars, 5:2 (2002), 81–124.
A. Okhotin, “On a new family of automata”, Technical Report 2002-456, Department of Computing and Information Science of Queen’s University, Kingston, Ontario, Canada.
A. Okhotin, “Efficient automaton-based recognition for linear conjunctive languages”, this volume.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okhotin, A. (2003). Whale Calf, a Parser Generator for Conjunctive Grammars. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-44977-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40391-3
Online ISBN: 978-3-540-44977-5
eBook Packages: Springer Book Archive