A hierarchy of uniquely parsable grammar classes and deterministic acceptors

DOI10.1007/S002360050091zbMATH Open0865.68076OpenAlexW2021531207MaRDI QIDQ1920229FDOQ1920229

Authors 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

zbMATH Keywords

parsingdeterministic context-free languagesrewriting rulesphrase structure grammaruniquely parsable grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1543333
• Uniquely parsable unification grammars and their parser implemented in Prolog
• scientific article; zbMATH DE number 3843162
• GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS
• Deterministic grammars and grammar morphisms
• scientific article; zbMATH DE number 3846897
• Unification grammars and off-line parsability
• scientific article; zbMATH DE number 1870544
• scientific article; zbMATH DE number 1089086
• Polynomially parsable unification grammars

Cited in

(9)

• Deterministic grammars and grammar morphisms
• GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS
• Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
• Stack cooperation in multistack pushdown automata
• Uniquely parsable unification grammars and their parser implemented in Prolog
• A three-dimensional uniquely parsable array grammar that generates and parses cubes
• scientific article; zbMATH DE number 1543333 (Why is no real title available?)
• Emergence of universal global behavior from reversible local transitions in asynchronous systems
• Sequential and maximally parallel multiset rewriting: reversibility and determinism

This page was built for publication: A hierarchy of uniquely parsable grammar classes and deterministic acceptors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920229)