Efficient LR(1) processor construction

DOI10.1145/800169.805433MaRDI QIDQ5402518zbMATH OpenOpenAlexFDO

Authors A. J. Korenjak

Publication date 14 March 2014

Published in Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800169.805433

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• On \(\mathrm{LR}(k)\)-parsers of polynomial size (extended abstract)
• scientific article; zbMATH DE number 194074
• scientific article; zbMATH DE number 6851912
• scientific article; zbMATH DE number 4197438
• Generation of efficient LALR parsers for regular right part grammars

Cited in

(32)

• Truly prefix-correct chain-free LR(1) parsers
• Looping LR parsers
• The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
• scientific article; zbMATH DE number 4100631 (Why is no real title available?)
• scientific article; zbMATH DE number 3930368 (Why is no real title available?)
• A short proof of a conjecture of De Remer and Pennello
• scientific article; zbMATH DE number 2050923 (Why is no real title available?)
• An improved LALR\((k)\) parser generation for regular right part grammars
• scientific article; zbMATH DE number 4094847 (Why is no real title available?)
• On the correct elimination of chain productions from lr parsers
• scientific article; zbMATH DE number 4155911 (Why is no real title available?)
• scientific article; zbMATH DE number 3860423 (Why is no real title available?)
• scientific article; zbMATH DE number 4033120 (Why is no real title available?)
• Semantic routines and \(LR(k)\) parsers
• Optimization of LR(\(k\)) reduced parsers
• LR parsing for global index languages (GILs)
• Some observations on LR-like parsing with delayed reduction
• scientific article; zbMATH DE number 827977 (Why is no real title available?)
• scientific article; zbMATH DE number 4155912 (Why is no real title available?)
• scientific article; zbMATH DE number 4155913 (Why is no real title available?)
• Shift-reduce parsers for transition networks
• Complexity of extended vs. classic LR parsers
• SLR(1) and LALR(1) parsing for unrestricted grammars
• On the incremental growth and shrinkage of LR goto-graphs
• Improvement of the LR parsing table and its application to grammatical error correction
• An efficient ELL(1)-parser generator
• scientific article; zbMATH DE number 3915654 (Why is no real title available?)
• scientific article; zbMATH DE number 434493 (Why is no real title available?)
• A new analysis of LALR formalisms
• scientific article; zbMATH DE number 194074 (Why is no real title available?)
• A compiler writing system based on affix grammars
• On parsing and condensing substrings of LR languages in linear time

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Efficient \(LR(1)\) processor construction

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