Practical optimization of LR(1) parsers

MaRDI QIDQ582925zbMATH OpenFDO

Authors V. N. Makarov

Publication date 1988

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

deterministic context-free languagesLR parserLR(1) grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of software (68N99) Formal languages and automata (68Q45)

Recommendations

• Optimization of LR(\(k\)) reduced parsers
• scientific article; zbMATH DE number 1519884
• Practical arbitrary lookahead LR parsing
• scientific article; zbMATH DE number 4100631
• Even faster generalized LR parsing
• On the reduction of \(LR(k)\) parsers
• Complexity of extended vs. classic LR parsers
• Practical LL(1)-based parsing of van Wijngaarden grammars
• Validating LR(1) Parsers

Cited in

(5)

• Generation of efficient LALR parsers for regular right part grammars
• Upper bounds on the size of LR(k) parsers
• Validating LR(1) Parsers
• scientific article; zbMATH DE number 2087566 (Why is no real title available?)
• scientific article; zbMATH DE number 7453089 (Why is no real title available?)

This page was built for publication: Practical optimization of LR(1) parsers

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