The size of LALR (1) parsers

DOI10.1007/BF01933232zbMath0307.68007MaRDI QIDQ4065011

Paul Walton jun. Purdom

Publication date: 1974

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (5)

An experimental ambiguity detection tool ⋮ Parsing extended LR(k) grammars ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. I ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. II ⋮ Lower bounds on the size of deterministic parsers

Uses Software

• ALGOL 60
• Euler

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient LR(1) parsers
• On the relative efficiencies of context-free grammar
• Syntactic Analysis and Operator Precedence
• EULER: A generalization of ALGOL and its formal definition: Part 1
• A transitive closure algorithm
• A technique for generating almost optimal Floyd-Evans productions for precedence grammars
• A solution to an open problem by Knuth
• On the translation of languages from left to right
• Bounded context syntactic analysis

This page was built for publication: The size of LALR (1) parsers