Recursive descent parsing for Boolean grammars

The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.

• Type: Journal
• Year: 2007
• Where: ACTA
• Authors: Alexander Okhotin
• Keywords: ACTA 2007, Context-free Grammars, Explicit Set-theoretic Operations, Grammars