An improved LALR\((k)\) parser generation for regular right part grammars
From MaRDI portal
Publication:689632
DOI10.1016/0020-0190(93)90235-2zbMath0797.68099MaRDI QIDQ689632
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
finite automata; formal languages; extended \(\text{LALR}(k)\) parser; extended LR(0) automaton; regular right part grammars
68Q45: Formal languages and automata
68N20: Theory of compilers and interpreters
68Q42: Grammars and rewriting systems
Related Items
Characterization of extended \(\mathrm{LR}(k)\) grammars, A note on a proposed LALR parser for extended context-free grammars, Towards a Taxonomy for ECFG and RRPG Parsing
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- A new analysis of LALR formalisms
- Efficient Computation of LALR(1) Look-Ahead Sets
- Regular right part grammars and their parsers
- Simple LR(k) grammars