Extending lookahead for LR parsers

DOI10.1016/0022-0000(81)90030-1zbMath0472.68049OpenAlexW2036685770MaRDI QIDQ1157920

Theodore P. Baker

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90030-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items (6)

A Yacc extension for LRR grammar parsing ⋮ An experimental ambiguity detection tool ⋮ Left-to-right regular languages and two-way restarting automata ⋮ Suffix languages in Lr parsing ⋮ Practical arbitrary lookahead LR parsing ⋮ Unnamed Item

Uses Software

• Ada95

Cites Work

• Unnamed Item
• LR-regular grammars - an extension of LR(k) grammars
• Efficient Computation of LALR(1) Look-Ahead Sets
• Automatic error recovery for LR parsers
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: Extending lookahead for LR parsers