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

DOI10.1016/S0022-0000(77)80017-2zbMath0363.68091MaRDI QIDQ1240564

Michael A. Harrison, Matthew M. Geller

Publication date: 1977

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On LLP(k) grammars and languages ⋮ A Scheme for LR(k) parsing with error recovery ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On LR(k) grammars and languages
• Characteristic parsing: A framework for producing compact deterministic parsers. II
• 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
• An efficient context-free parsing algorithm
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: Characteristic parsing: A framework for producing compact deterministic parsers. I