The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
From MaRDI portal
Publication:1239010
DOI10.1016/0020-0255(77)90036-6zbMath0357.68084MaRDI QIDQ1239010
Publication date: 1977
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(77)90036-6
68Q45: Formal languages and automata
Related Items
Suffix languages in Lr parsing, The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution, A Yacc extension for LRR grammar parsing, Parsing extended LR(k) grammars, Diagnostics on LALR(k) conflicts based on a method for LR(k) testing, A practical general method for constructing LR(k) parsers
Cites Work
- A practical general method for constructing LR(k) parsers
- Efficient LR(1) 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