Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time

DOI10.1007/11812128_24MaRDI QIDQ5757227zbMATH OpenOpenAlexFDO

Authors José Fortes Gálvez, Sylvain Schmitz, Jacques Farré

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_24

Mathematics Subject Classification ID

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

Recommendations

• Practical arbitrary lookahead LR parsing
• Packrat parsing: simple, powerful, lazy, linear time
• scientific article; zbMATH DE number 1693498
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
• Lookahead lr parsing with regular right part grammars

Cited in

(2)

• Packrat parsing: simple, powerful, lazy, linear time
• A predictive bottom-up parser

This page was built for publication: Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time

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