An improved LALR\((k)\) parser generation for regular right part grammars
From MaRDI portal
Publication:689632
DOI10.1016/0020-0190(93)90235-2zbMath0797.68099OpenAlexW2016782436MaRDI 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 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)
Related Items
A note on a proposed LALR parser for extended context-free grammars ⋮ Characterization of extended \(\mathrm{LR}(k)\) 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
This page was built for publication: An improved LALR\((k)\) parser generation for regular right part grammars