Boolean grammar
Boolean grammars, introduced by Alexander Okhotin ({{{2}}}), are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars allow implicit disjunction represented by multiple rules for a single nonterminal symbol, which is the only logical connective expressible in context-free grammars. Conjunction and negation can be used, in particular, to specify intersection and complement of languages. An intermediate class of grammars known as conjunctive grammars allows conjunction and disjunction, but not negation. The rules of a Boolean grammar are of the form
[math]\displaystyle{ A \to \alpha_1 \And \ldots \And \alpha_m \And \lnot\beta_1 \And \ldots \And \lnot\beta_n }[/math]
where [math]\displaystyle{ A }[/math] is a nonterminal, [math]\displaystyle{ m+n \ge 1 }[/math] and [math]\displaystyle{ \alpha_1 }[/math], ..., [math]\displaystyle{ \alpha_m }[/math], [math]\displaystyle{ \beta_1 }[/math], ..., [math]\displaystyle{ \beta_n }[/math] are strings formed of symbols in [math]\displaystyle{ \Sigma }[/math] and [math]\displaystyle{ N }[/math]. Informally, such a rule asserts that every string [math]\displaystyle{ w }[/math] over [math]\displaystyle{ \Sigma }[/math] that satisfies each of the syntactical conditions represented by [math]\displaystyle{ \alpha_1 }[/math], ..., [math]\displaystyle{ \alpha_m }[/math] and none of the syntactical conditions represented by [math]\displaystyle{ \beta_1 }[/math], ..., [math]\displaystyle{ \beta_n }[/math] therefore satisfies the condition defined by [math]\displaystyle{ A }[/math].
There exist several formal definitions of the language generated by a Boolean grammar. They have one thing in common: if the grammar is represented as a system of language equations with union, intersection, complementation and concatenation, the languages generated by the grammar must be the solution of this system. The semantics differ in details, some define the languages using language equations, some draw upon ideas from the field of logic programming. However, these nontrivial issues of formal definition are mostly irrelevant for practical considerations, and one can construct grammars according to the given informal semantics. The practical properties of the model are similar to those of conjunctive grammars, while the descriptional capabilities are further improved. In particular, some practically useful properties inherited from context-free grammars, such as efficient parsing algorithms, are retained, see (Okhotin 2010).
References
- Okhotin, Alexander (2004-10-10). "Boolean Grammars". Information and Computation 194 (1): 19–48. doi:10.1016/j.ic.2004.03.006.
- Kountouriotis, Vassilis; Nomikos, Christos; Rondogiannis, Panos (2009). "Well-founded semantics for Boolean grammars". Information and Computation 207 (9): 945–967. doi:10.1016/j.ic.2009.05.002. http://www.di.uoa.gr/%7Eprondo/papers/knr09.pdf.
- Okhotin, Alexander (2010). "Fast parsing for Boolean grammars: a generalization of Valiant's algorithm". Developments in Language Theory. 14th International Conference, DLT 2010, London, ON, Canada, August 17–20, 2010, Proceedings. Lecture Notes in Computer Science. 6224. pp. 340–351. Preprint available online, .
External links
 |  |
