Linear precedence functions for weak precedence grammars

DOI10.1080/00207167208803059zbMath0262.68032OpenAlexW2164249367MaRDI QIDQ5678443

Jeffrey D. Ullman, A. V. Aho

Publication date: 1972

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167208803059

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Error detection in precedence parsers

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs
• Syntactic Analysis and Operator Precedence
• EULER: A generalization of ALGOL and its formal definition: Part 1
• A new method for determining linear precedence functions for precedence grammars
• A technique for generating almost optimal Floyd-Evans productions for precedence grammars
• A Boolean matrix method for the computation of linear precedence functions
• Weak and Mixed Strategy Precedence Parsing

This page was built for publication: Linear precedence functions for weak precedence grammars