Generalized overlap resolvable grammars and their parsers

DOI10.1016/S0022-0000(72)80030-8zbMath0277.68047MaRDI QIDQ1393941

David S. Wise

Publication date: 1972

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Generalized overlap resolvable grammars and their parsers ⋮ Classes of formal grammars

Uses Software

• ALGOL 68
• Euler

Cites Work

• Unnamed Item
• Generalized overlap resolvable grammars and their parsers
• Report on the algorithmic language ALGOL 68
• Total Precedence Relations
• Some properties of precedence languages
• EULER: A generalization of ALGOL and its formal definition: Part 1
• Algorithms for the recognition of properties of sequences of symbols
• Deterministic context free languages
• Syntax-Directed Transduction
• Syntax analysis by Domolki's algorithm
• A technique for generating almost optimal Floyd-Evans productions for precedence grammars
• Simple LR(k) grammars
• On the translation of languages from left to right
• Weak and Mixed Strategy Precedence Parsing
• Bounded context syntactic analysis

This page was built for publication: Generalized overlap resolvable grammars and their parsers