A functional LR parser

DOI10.1016/0304-3975(92)90128-3MaRDI QIDQ1200812zbMATH OpenOpenAlexFDO

Authors René Leermakers, Lex Augusteijn, Frans E. J. Kruseman Aretz

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)90128-3

zbMATH Keywords

\(LR(0)\) parsersrecursive ascent parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• A recursive ascent Earley parser
• Memoizing purely functional top-down backtracking language processors
• Simple, functional, sound and complete parsing for all context-free grammars
• Recursive ascent parsing: From Earley to Marcus
• Parsing with derivatives

Cites work

• On a recursive ascent parser
• Optimization of LR(k) parsers
• SL parses the LR languages
• The theory of languages

Cited in

(7)

• An unrealistic parser
• Validating LR(1) Parsers
• LR-parsing derived
• Functional un\(|\)unparsing
• Parsing with derivatives
• A recursive ascent Earley parser
• Recursive ascent parsing: From Earley to Marcus

This page was built for publication: A functional LR parser

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