Some properties of precedence languages
From MaRDI portal
Publication:5402517
DOI10.1145/800169.805432zbMath1282.68148OpenAlexW1972531631MaRDI QIDQ5402517
Publication date: 14 March 2014
Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800169.805432
Related Items (15)
First-Order Logic Definability of Free Languages ⋮ Epsilon weak precedence grammars and languages ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Beyond operator-precedence grammars and languages ⋮ Generalized overlap resolvable grammars and their parsers ⋮ Experience with a conversational parser generating system ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Precedence Automata and Languages ⋮ Operator precedence and the visibly pushdown property ⋮ A note on weak operator precedence grammars ⋮ A note on weak operator precedence grammars ⋮ Precedence-regular grammars ⋮ Weighted operator precedence languages ⋮ Soft precedence
This page was built for publication: Some properties of precedence languages
