Abstract
As a direct continuation of the earlier research on conjunctive grammars — context-free grammars equipped with intersection — this paper introduces a new class of formal grammars, which allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for such grammars is defined by language equations in a way that allows to generalize some techniques from the theory of context-free grammars, including Chomsky normal form, Cocke—Kasami—Younger recognition algorithm and some limited extension of the notion of a parse tree, which together allow to conjecture the practical applicability of the new concept.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Autebert, J. Berstel and L. Boasson, “Context-Free Languages and Pushdown Automata”, Handbook of Formal Languages, Vol. 1, 111–174, Springer-Verlag, Berlin, 1997.
K. Culik II, J. Gruska, A. Salomaa, “Systolic trellis automata”, I and II, Internat. Journal of Computer Mathematics, 15 (1984), 195–212, and 16 (1984), 3–22.
E.L. Leiss, Language equations, Springer-Verlag, New York, 1999.
A. Okhotin, “Conjunctive grammars”, Journal of Automata, Languages and Combinatorics, 6:4 (2001), 519–535.
A. Okhotin, “Conjunctive grammars and systems of language equations”, Programming and Computer Software, 28:5 (2002), 243–249.
A. Okhotin, “Automaton representation of linear conjunctive languages”, Developments in Language Theory (Proceedings of DLT 2002), LNCS, to appear.
A. Okhotin, “Whale Calf, a parser generator for conjunctive grammars”, Implementation and Application of Automata (Proc. of CIAA 2002), LNCS, to appear; the software is available at http://www.cs.queensu.ca/home/okhotin/whalecalf/, http://www.cs.queensu.ca/home/okhotin/whalecalf/.
A. Okhotin, “Decision problems for language equations with Boolean operations”, Proceedings of ICALP 2003, LNCS, to appear.
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). Boolean Grammars. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_32
Download citation
DOI: https://doi.org/10.1007/3-540-45007-6_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40434-7
Online ISBN: 978-3-540-45007-8
eBook Packages: Springer Book Archive