Practical arbitrary lookahead LR parsing

DOI10.1016/0022-0000(90)90037-LzbMath0698.68070MaRDI QIDQ912646

Karl M. Schimpf, Manuel E. Bermudez

Publication date: 1990

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(90)90037-l

zbMATH Keywords

context-free grammars; lookahead; LR parsing

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N20: Theory of compilers and interpreters

Related Items

Left-to-right regular languages and two-way restarting automata, Reachability Analysis of Pushdown Systems with an Upper Stack, Model-Checking HyperLTL for Pushdown Systems, Regular languages viewed from a graph-theoretic perspective, Bounded-connect noncanonical discriminating-reverse parsers., Unnamed Item, A general model for fixed look-ahead lr parsers

Uses Software

• COBOL
• Ada95
• PL/I
• YACC

Cites Work

• Unnamed Item
• Extending lookahead for LR parsers
• A practical general method for constructing LR(k) parsers
• Efficient LR(1) parsers
• LR-regular grammars - an extension of LR(k) grammars
• A new analysis of LALR formalisms
• The Complexity of LALR (k) Testing
• Methods for Computing LALR( k ) Lookahead
• Efficient Computation of LALR(1) Look-Ahead Sets
• A practical method for constructing LR ( k ) processors
• Simple LR(k) grammars
• On the translation of languages from left to right