A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars

DOI10.1145/321526.321531MaRDI QIDQ5563367zbMATH OpenOpenAlexFDO

Authors

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321526.321531

zbMATH Keywords

languages, automata, networks

Cited in

(7)

• Theory of formal grammars
• An extension of context-free grammars with one-sided context specifications
• Tabulator-Turingmaschine und Komplexität. (Tabulator Turing machine and complexity)
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Relationships between pushdown automata with counters and complexity classes
• A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams
• Unambiguous Boolean grammars

This page was built for publication: A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars

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