Recursive descent parsing for Boolean grammars

Authors:
Alexander Okhotin
Affiliations:
University of Turku, Department of Mathematics, 20014, Turku, Finland and Academy of Finland, Vilhonvuorenkatu 6, Helsinki, 00501, Finland
Venue:
Acta Informatica
Year:
2007

Citing 0
Cited 9

Unambiguous Boolean grammars

Information and Computation
A simple P-complete problem and its representations by language equations

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Conjunctive grammars with restricted disjunction

Theoretical Computer Science
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm

DLT'10 Proceedings of the 14th international conference on Developments in language theory
A simple P-complete problem and its language-theoretic representations

Theoretical Computer Science
Language equations with complementation: Expressive power

Theoretical Computer Science
Defining contexts in context-free grammars

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Expressive power of LL(k) Boolean grammars

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Parsing by matrix multiplication generalized to Boolean grammars

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.