A practical general method for constructing LR(k) parsers
From MaRDI portal
Publication:1238429
DOI10.1007/BF00290336zbMath0358.68116MaRDI QIDQ1238429
Publication date: 1977
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
A Yacc extension for LRR grammar parsing ⋮ Simple computation of LALR(1) lookahead sets ⋮ Suffix languages in Lr parsing ⋮ A parsing automata approach to LR theory ⋮ Diagnostics on LALR(k) conflicts based on a method for LR(k) testing ⋮ Practical arbitrary lookahead LR parsing ⋮ A general model for fixed look-ahead lr parsers ⋮ On the correct elimination of chain productions from lr parsers ⋮ On the reduction of \(LR(k)\) parsers ⋮ The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution ⋮ The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency ⋮ Lar(m, c, l) grammars
Cites Work
- The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
- Optimization of LR(k) parsers
- A Technique for Speeding up ${\text{LR}}(k)$ Parsers
- A practical method for constructing LR ( k ) processors
- A solution to an open problem by Knuth
- Simple LR(k) grammars
- On the translation of languages from left to right
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
