LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
From MaRDI portal
Publication:3007638
DOI10.1007/978-3-642-20712-9_27zbMath1332.68102OpenAlexW2256540913WikidataQ56059681 ScholiaQ56059681MaRDI QIDQ3007638
Michael Kaminski, Tamar Aizikowitz
Publication date: 17 June 2011
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_27
Related Items
Conjunctive grammars and alternating pushdown automata ⋮ Input-driven languages are linear conjunctive ⋮ Generalized LR Parsing for Grammars with Contexts ⋮ Generalized LR parsing algorithm for grammars with one-sided contexts ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ LR parsing for LCFRS ⋮ An extension of context-free grammars with one-sided context specifications ⋮ The Hardest Language for Conjunctive Grammars ⋮ Two-sided context specifications in formal grammars
Cites Work
- Unnamed Item
- Unnamed Item
- A recognition and parsing algorithm for arbitrary conjunctive grammars.
- Top-down parsing of conjunctive languages
- Alternating Pushdown and Stack Automata
- Conjunctive Grammars and Alternating Pushdown Automata
- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm
- Alternation
- On the translation of languages from left to right
This page was built for publication: LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata