A hierarchy of uniquely parsable grammar classes and deterministic acceptors
From MaRDI portal
Publication:1920229
DOI10.1007/s002360050091zbMath0865.68076OpenAlexW2021531207MaRDI QIDQ1920229
Kenichi Morita, Noritaka Nishihara, Yasunori Yamamoto, Zhi-Guo Zhang
Publication date: 25 September 1996
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050091
parsingdeterministic context-free languagesrewriting rulesphrase structure grammaruniquely parsable grammars
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)
Related Items
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars., Emergence of universal global behavior from reversible local transitions in asynchronous systems, Sequential and maximally parallel multiset rewriting: reversibility and determinism, Stack cooperation in multistack pushdown automata
