LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
DOI10.1016/J.JCSS.2016.05.008zbMATH Open1348.68079OpenAlexW2426482043MaRDI QIDQ736618FDOQ736618
Authors: Tamar Aizikowitz, Michael Kaminski 
Publication date: 4 August 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.05.008
Recommendations
- \(LR(0)\) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
- Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
- LR parsing for conjunctive grammars
- Top-down parsing of conjunctive languages
conjunctive grammarsdeterministic synchronized alternating pushdown automataLR(0) conjunctive grammarssynchronized alternating pushdown automata
Cites Work
- Nondeterminism and Boolean operations in pda's
- Alternation
- Title not available (Why is that?)
- Recognition and parsing of context-free languages in time n3
- General context-free recognition in less than cubic time
- Boolean grammars
- Optimization of LR(k) parsers
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Title not available (Why is that?)
- Syntax-Directed Transduction
- Weak alternating automata are not that weak
- A recognition and parsing algorithm for arbitrary conjunctive grammars.
- Top-down parsing of conjunctive languages
- LR parsing for conjunctive grammars
- Conjunctive grammars and alternating pushdown automata
- Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
- On the translation of languages from left to right
- Alternating Pushdown and Stack Automata
- Conjunctive Grammars and Alternating Pushdown Automata
Cited In (6)
- Hardest languages for conjunctive and Boolean grammars
- Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
- \(LR(0)\) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
- Unambiguous conjunctive grammars over a one-symbol alphabet
- Linear-space recognition for grammars with contexts
This page was built for publication: LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736618)
