A technique for generating almost optimal Floyd-Evans productions for precedence grammars

DOI10.1145/362705.362712zbMath0205.19002OpenAlexW1976102037MaRDI QIDQ5604904

Jean D. Ichbiah, Stephen Paul Morse

Publication date: 1970

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

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

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items

Epsilon weak precedence grammars and languages ⋮ Generalized overlap resolvable grammars and their parsers ⋮ Error detection in precedence parsers ⋮ SR(s,k) parsers: A class of shift-reduce bounded-context parsers ⋮ Linear precedence functions for weak precedence grammars ⋮ The size of LALR (1) parsers ⋮ A note on weak operator precedence grammars ⋮ A note on weak operator precedence grammars ⋮ Soft precedence