GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS

DOI10.1142/S0129054106004029zbMath1098.68060MaRDI QIDQ5483377

Alexander Okhotin

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

parsinglanguage equationsBoolean grammarsconjunctive grammarsbottom-upLRshift-reduce

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Recursive descent parsing for Boolean grammars ⋮ Generalized LR Parsing for Grammars with Contexts ⋮ Generalized LR parsing algorithm for grammars with one-sided contexts ⋮ Parsing by matrix multiplication generalized to Boolean grammars ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A simple P-complete problem and its language-theoretic representations ⋮ One-nonterminal conjunctive grammars over a unary alphabet ⋮ LR parsing for LCFRS ⋮ Unambiguous Boolean grammars ⋮ An extension of context-free grammars with one-sided context specifications ⋮ Expressive power of \(\text{LL}(k)\) Boolean grammars ⋮ BOOLEAN GRAMMARS AND GSM MAPPINGS ⋮ Language equations with complementation: expressive power

Cites Work

• Unnamed Item
• LR parsing for conjunctive grammars
• Boolean grammars
• Principles and implementation of deductive parsing
• On the translation of languages from left to right
• Even faster generalized LR parsing