TY - JOUR

T1 - Generalized LR parsing algorithm for Boolean grammars

AU - Okhotin, Alexander

PY - 2006/6/1

Y1 - 2006/6/1

N2 - 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).

AB - 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).

KW - Boolean grammars

KW - Bottom-up

KW - Conjunctive grammars

KW - Language equations

KW - LR

KW - Parsing

KW - Shift-reduce

UR - http://www.scopus.com/inward/record.url?scp=33746190624&partnerID=8YFLogxK

U2 - 10.1142/S0129054106004029

DO - 10.1142/S0129054106004029

M3 - Article

AN - SCOPUS:33746190624

VL - 17

SP - 629

EP - 664

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 3

ER -