Directly-executable earley parsing

DOI10.1007/3-540-45306-7_16MaRDI QIDQ2764077zbMATH OpenFDO

Authors John Aycock, R. Nigel Horspool

Publication date 22 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2027/20270229

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Practical Earley Parsing
• scientific article; zbMATH DE number 4197437
• A recursive ascent Earley parser
• scientific article; zbMATH DE number 2202218
• A new approach to Earley's parsing algorithm

Cited in

(10)

• Early action in an Earley parser
• Recursive ascent parsing: From Earley to Marcus
• Recognition is not parsing - SPPF-style parsing from cubic recognisers
• Packrat parsing: simple, powerful, lazy, linear time
• scientific article; zbMATH DE number 4191135 (Why is no real title available?)
• Practical Earley Parsing
• On the incremental growth and shrinkage of LR goto-graphs
• scientific article; zbMATH DE number 4197437 (Why is no real title available?)
• Authoring Verified Documents by Interactive Proof Construction and Verification in Text-Editors
• A verified earley parser

This page was built for publication: Directly-executable earley parsing

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