Efficient LR(1) parsers

DOI10.1007/BF00571461zbMath0235.68009OpenAlexW1964781382MaRDI QIDQ2552024

Yanyan Li

Publication date: 1973

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00571461

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (9)

A Yacc extension for LRR grammar parsing ⋮ Simple computation of LALR(1) lookahead sets ⋮ A parsing automata approach to LR theory ⋮ Practical arbitrary lookahead LR parsing ⋮ The size of LALR (1) parsers ⋮ On a method for optimizing LR parsers ⋮ The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency ⋮ Classes of formal grammars ⋮ Lar(m, c, l) grammars

Uses Software

• ALGOL 60
• PL360

Cites Work

• EULER: A generalization of ALGOL and its formal definition: Part 1
• A contribution to the development of ALGOL
• PL360, a Programming Language for the 360 Computers
• Translator writing systems
• Syntax-Directed Transduction
• A practical method for constructing LR ( k ) processors
• An efficient context-free parsing algorithm
• A solution to an open problem by Knuth
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: Efficient LR(1) parsers