Memoizing purely functional top-down backtracking language processors

DOI10.1016/0167-6423(96)00014-7MaRDI QIDQ1126263zbMATH OpenOpenAlexFDO

Authors Richard A. Frost, Barbara Szydlowski

Publication date 18 February 1997

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(96)00014-7

zbMATH Keywords

language processors

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Recommendations

• Efficient memo-table management strategies
• A functional LR parser
• Algebraic Transformation Techniques for Functional Languages

Cited in

(6)

• Efficient memo-table management strategies
• Proof-directed program transformation: a functional account of efficient regular expression matching
• Partial memoization of concurrency and communication
• Programming Languages and Systems
• Applicative caching
• A functional LR parser

This page was built for publication: Memoizing purely functional top-down backtracking language processors

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