Boundedly \(\text{LR}(k)\)-conflictable grammars

DOI10.1007/BF01218406zbMath0790.68062OpenAlexW2079714538MaRDI QIDQ1323386

Kwang-Moo Choe, Myung-Joon Lee

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01218406

zbMATH Keywords

context-free grammarsambiguous grammarslinear time parsingLR\((k)\) grammarLR\((k)\) parsing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• SLR(k) covering for LR(k) grammars
• Complexity metatheorems for context-free grammar problems
• LR-regular grammars - an extension of LR(k) grammars
• Optimization of LR(k) parsers
• A new analysis of LALR formalisms
• On the Complete Covering Problem for LR ( k )Grammars
• Bounded context parsable grammars
• Noncanonical Extensions of Bottom-Up Parsing Techniques
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: Boundedly \(\text{LR}(k)\)-conflictable grammars