Generalized LR Parsing for Grammars with Contexts

DOI10.1007/978-3-319-20297-6_5zbMath1466.68049OpenAlexW1062543421MaRDI QIDQ3194708

Mikhail Barash, Alexander Okhotin

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Grammars and rewriting systems (68Q42)

Related Items

Improved normal form for grammars with one-sided contexts ⋮ Two-sided context specifications in formal grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• LR parsing for conjunctive grammars
• An extension of context-free grammars with one-sided context specifications
• Improved Normal Form for Grammars with One-Sided Contexts
• LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
• Recognizing Two-Sided Contexts in Cubic Time
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• On the translation of languages from left to right