A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
From MaRDI portal
Publication:5563367
DOI10.1145/321526.321531zbMath0175.00802OpenAlexW2076042735MaRDI QIDQ5563367
No author found.
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
Related Items (7)
A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Unambiguous Boolean grammars ⋮ An extension of context-free grammars with one-sided context specifications ⋮ Relationships between pushdown automata with counters and complexity classes ⋮ Tabulator-Turingmaschine und Komplexität. (Tabulator Turing machine and complexity) ⋮ Theory of formal grammars
This page was built for publication: A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
