An improved LALR(k) parser generation for regular right part grammars
DOI10.1016/0020-0190(93)90235-2zbMATH Open0797.68099OpenAlexW2016782436MaRDI QIDQ689632FDOQ689632
Authors: Heung-Chul Shin, Kwang-Moo Choe 
Publication date: 15 November 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90235-2
Recommendations
finite automataformal languagesextended \(\text{LALR}(k)\) parserextended LR(0) automatonregular right part grammars
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)
Cites Work
- LALR(1,1) parser generation for regular right part grammars
- Generation of efficient LALR parsers for regular right part grammars
- Parsing extended LR(k) grammars
- LR-parsing of extended context free grammars
- On the definition of ELR(k) and ELL(k) grammars
- Constructing LR parsers for regular right part grammars
- Regular right part grammars and their parsers
- Efficient Computation of LALR(1) Look-Ahead Sets
- A new analysis of LALR formalisms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple LR(k) grammars
Cited In (9)
- A Yacc extension for LRR grammar parsing
- The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
- Characterization of extended \(\mathrm{LR}(k)\) grammars
- Generation of efficient LALR parsers for regular right part grammars
- A note on a proposed LALR parser for extended context-free grammars
- Title not available (Why is that?)
- Yet another generation of LALR parsers for regular right part grammars
- Towards a Taxonomy for ECFG and RRPG Parsing
- An efficient ELL(1)-parser generator
This page was built for publication: An improved LALR\((k)\) parser generation for regular right part grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689632)
