LR Parsing for Boolean Grammars

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/11505877_32 ◽

2005 ◽

pp. 362-373 ◽

Cited By ~ 2

Author(s):

Alexander Okhotin

Keyword(s):

Lr Parsing ◽

Boolean Grammars

Download Full-text

GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054106004029 ◽

2006 ◽

Vol 17 (03) ◽

pp. 629-664 ◽

Cited By ~ 18

Author(s):

ALEXANDER OKHOTIN

Keyword(s):

The Other ◽

Lr Parsing ◽

Other Hand ◽

Logical Connectives ◽

Parsing Algorithm ◽

Boolean Grammars ◽

Mathematical Justification ◽

Context Free ◽

Context Free Grammars

The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the 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 operation makes the mathematical justification of the algorithm significantly different from its prototype. On the other hand, the changes in the implementation are not very substantial, and the algorithm still works in time O(n4).

Download Full-text

Suffix languages in Lr parsing

International Journal of Computer Mathematics ◽

10.1080/00207169508804370 ◽

1995 ◽

Vol 55 (3-4) ◽

pp. 135-153 ◽

Cited By ~ 1

Author(s):

Benjamin R. Seyfarth ◽

Manuel E. Bermudez

Keyword(s):

Lr Parsing

Download Full-text

BOOLEAN GRAMMARS AND GSM MAPPINGS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054110007568 ◽

2010 ◽

Vol 21 (05) ◽

pp. 799-815 ◽

Cited By ~ 8

Author(s):

TOMMI LEHTINEN ◽

ALEXANDER OKHOTIN

Keyword(s):

Sequential Machine ◽

Language Family ◽

Conjunctive Grammars ◽

Boolean Grammars

It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and inverse gsm mappings (where gsm stands for a generalized sequential machine). The same results hold for conjunctive grammars, unambiguous Boolean grammars and unambiguous conjunctive grammars.

Download Full-text