A new analysis of LALR formalisms

DOI10.1145/2363.2527MaRDI QIDQ3341936zbMATH OpenOpenAlexFDO

Authors Kwang-Moo Choe, Chun-Hyon Chang, Joseph C. Park

Publication date 1985

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1985-7/

zbMATH Keywords

LALRlookahead setsparser generating system

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• Simple computation of LALR(1) lookahead sets
• scientific article; zbMATH DE number 6851912
• Efficient LR(1) processor construction
• scientific article; zbMATH DE number 4213462
• Generation of efficient LALR parsers for regular right part grammars

Cited in

(18)

• A Yacc extension for LRR grammar parsing
• Simple computation of LALR(1) lookahead sets
• The core of a CF-grammar and syntax analysis
• An efficient computation of right context for LR-based error repair
• Boundedly \(\text{LR}(k)\)-conflictable grammars
• Theory analysis on FSLDA and ULDA.
• A comparison study on different MLPG(LBIE) formulations
• scientific article; zbMATH DE number 4213462 (Why is no real title available?)
• scientific article; zbMATH DE number 4045204 (Why is no real title available?)
• A general model for fixed look-ahead lr parsers
• Lar(m, c, l) grammars
• Efficient computation of the locally least-cost insertion string for the LR error repair
• A fast method of lexical analysis
• On the reduction of \(LR(k)\) parsers
• Syntactic error repair using repair patterns
• An improved LALR\((k)\) parser generation for regular right part grammars
• SLR(k) covering for LR(k) grammars
• Practical arbitrary lookahead LR parsing

This page was built for publication: A new analysis of LALR formalisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341936)