A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Boolean grammars
2004
Information and Computation
Preserved Fulltext
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all settheoretic operations as an integral part of the formalism of rules. Rigorous semantics for these 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 cubic-time recognition algorithm and some limited extension of the notion of a parse tree, which together allow
doi:10.1016/j.ic.2004.03.006
fatcat:72ahhppp7rdu7dh522atfhgq7u