On parsing LL-languages

DOI10.1016/S0304-3975(00)00295-4MaRDI QIDQ5958724zbMATH OpenOpenAlexFDO

Authors Norbert Blum

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00295-4

zbMATH Keywords

extended parsergrammarparsersize of parser

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 1452980
• scientific article; zbMATH DE number 3860423
• On \(\mathrm{LR}(k)\)-parsers of polynomial size (extended abstract)
• scientific article; zbMATH DE number 3856438
• Lower bounds on the size of deterministic parsers

Cites work

• scientific article; zbMATH DE number 193480 (Why is no real title available?)
• scientific article; zbMATH DE number 194074 (Why is no real title available?)
• scientific article; zbMATH DE number 814823 (Why is no real title available?)
• Lower bounds on the size of deterministic parsers
• Optimization of LR(k) parsers

Cited in

(12)

• An incremental LL(1) parsing algorithm
• Comparison of LZ77-type parsings
• Dynamic \(\text{LL} (k)\) parsing
• Bidirectional parsing for linear languages
• In memoriam Chandra Kintala
• scientific article; zbMATH DE number 3856438 (Why is no real title available?)
• On \(\mathrm{LR}(k)\)-parsers of polynomial size (extended abstract)
• scientific article; zbMATH DE number 3930368 (Why is no real title available?)
• scientific article; zbMATH DE number 4033121 (Why is no real title available?)
• scientific article; zbMATH DE number 193480 (Why is no real title available?)
• scientific article; zbMATH DE number 1452980 (Why is no real title available?)
• Lower bounds on the size of deterministic parsers

This page was built for publication: On parsing LL-languages

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