A new analysis of LALR formalisms

DOI10.1145/2363.2527zbMath0549.68083OpenAlexW2049727710MaRDI QIDQ3341936

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)

Related Items (12)

A Yacc extension for LRR grammar parsing ⋮ Simple computation of LALR(1) lookahead sets ⋮ Practical arbitrary lookahead LR parsing ⋮ A general model for fixed look-ahead lr parsers ⋮ On the reduction of \(LR(k)\) parsers ⋮ Syntactic error repair using repair patterns ⋮ An improved LALR\((k)\) parser generation for regular right part grammars ⋮ Efficient computation of the locally least-cost insertion string for the LR error repair ⋮ SLR(k) covering for LR(k) grammars ⋮ Lar(m, c, l) grammars ⋮ An efficient computation of right context for LR-based error repair ⋮ Boundedly \(\text{LR}(k)\)-conflictable grammars

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