Characteristic parsing: A framework for producing compact deterministic parsers. II

DOI10.1016/S0022-0000(77)80018-4zbMath0363.68092OpenAlexW4247778349MaRDI QIDQ1240565

Michael A. Harrison, Matthew M. Geller

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/s0022-0000(77)80018-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A Yacc extension for LRR grammar parsing ⋮ Two iteration theorems for the LL(k) languages ⋮ A parsing automata approach to LR theory ⋮ SR(s,k) parsers: A class of shift-reduce bounded-context parsers ⋮ On LLP(k) parsers ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ A Scheme for LR(k) parsing with error recovery ⋮ On LR(k) grammars and languages ⋮ Economy of description by parsers, DPDA's, and PDA's ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. I ⋮ Simple chain grammars and languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On LR(k) grammars and languages
• Characteristic parsing: A framework for producing compact deterministic parsers. I
• Pascal. User manual and report
• Strict deterministic grammars
• Optimization of LR(k) parsers
• On the Parsing of Deterministic Languages
• The size of LALR (1) parsers
• Practical syntactic error recovery
• An efficient context-free parsing algorithm
• Simple LR(k) grammars
• On the translation of languages from left to right