Recursive ascent parsing: From Earley to Marcus

DOI10.1016/0304-3975(92)90127-2zbMath0754.68072OpenAlexW2164260211MaRDI QIDQ1200809

René Leermakers

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90127-2

zbMATH Keywords

recursive functionsfunction memoizationfunctional implementation techniqueparsers for context-free grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items

Some observations on LR-like parsing with delayed reduction

Cites Work

• Unnamed Item
• Unnamed Item
• On a recursive ascent parser
• A recursive ascent Earley parser
• A functional LR parser
• SL parses the LR languages
• An efficient context-free parsing algorithm