The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency

DOI10.1016/0020-0255(77)90036-6MaRDI QIDQ1239010zbMATH OpenOpenAlexFDO

Authors David Pager

Publication date 1977

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(77)90036-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A practical general method for constructing LR(k) parsers
• A practical method for constructing LR ( k ) processors
• A solution to an open problem by Knuth
• Efficient LR(1) parsers
• scientific article; zbMATH DE number 3464810 (Why is no real title available?)
• scientific article; zbMATH DE number 3483546 (Why is no real title available?)
• scientific article; zbMATH DE number 3485226 (Why is no real title available?)
• scientific article; zbMATH DE number 3548470 (Why is no real title available?)
• scientific article; zbMATH DE number 3339415 (Why is no real title available?)
• On the translation of languages from left to right
• Simple LR(k) grammars

Cited in

(6)

• A Yacc extension for LRR grammar parsing
• Parsing extended LR(k) grammars
• Diagnostics on LALR(k) conflicts based on a method for LR(k) testing
• A practical general method for constructing LR(k) parsers
• Suffix languages in Lr parsing
• The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution

This page was built for publication: The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency

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