Characterization of extended \(\mathrm{LR}(k)\) grammars

DOI10.1016/S0020-0190(97)00152-XzbMath1337.68149MaRDI QIDQ287241

Do-Hyung Kim, Gyung-Ok Lee

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

formal languagescompilersextended context-free grammars\(\mathrm{ELALR}(k)\) grammars\(\mathrm{ELR}(k)\) grammarsfinite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (1)

Fast deterministic parsers for transition networks

Cites Work

• An improved LALR\((k)\) parser generation for regular right part grammars
• 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 note on a proposed LALR parser for extended context-free grammars
• Regular right part grammars and their parsers

This page was built for publication: Characterization of extended \(\mathrm{LR}(k)\) grammars