LR parsing for boolean grammars

Authors:
Alexander Okhotin
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 8
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
An efficient augmented-context-free parsing algorithm

Computational Linguistics
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Even faster generalized LR parsing

Acta Informatica
Why bison is becoming extinct

Crossroads
Boolean grammars

Information and Computation
Whale calf, a parser generator for conjunctive grammars

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized LR parsing algorithm for context-free grammars, invented by Tomita in 1986, is extended for the case of Boolean grammars, which are a recently introduced generalization of context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which reverses a previously made reduction; this makes the algorithm considerably different from its prototype, though it can still be made to work in time O(n3).