On the reduction of LR(k) parsers
From MaRDI portal
Publication:688231
DOI10.1016/0020-0190(93)90134-UzbMATH Open0818.68105OpenAlexW1996765415MaRDI QIDQ688231FDOQ688231
Authors: Woo-Jun Park, Myung-Joon Lee, Kwang-Moo Choe
Publication date: 24 August 1995
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90134-u
Recommendations
Cites Work
- A lattice-theoretical fixpoint theorem and its applications
- On the translation of languages from left to right
- A new analysis of LALR formalisms
- On the reduction of \(LR(k)\) parsers
- A parsing automata approach to LR theory
- A practical general method for constructing LR(k) parsers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple LR(k) grammars
- SLR(k) covering for LR(k) grammars
Cited In (13)
- Parameter-reduction of higher level grammars
- Redundancy of the Lempel-Ziv incremental parsing rule
- Practical optimization of LR(1) parsers
- On the reduction of \(LR(k)\) parsers
- On the prediction of reduction goals: A deterministic approach
- Title not available (Why is that?)
- Optimization of LR(\(k\)) reduced parsers
- Title not available (Why is that?)
- Some observations on LR-like parsing with delayed reduction
- Title not available (Why is that?)
- Upper bounds on the size of LR(k) parsers
- Title not available (Why is that?)
- On the size of parsers and \(\text{LR}(k)\)-grammars
This page was built for publication: On the reduction of \(LR(k)\) parsers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688231)