Memoizing purely functional top-down backtracking language processors

DOI10.1016/0167-6423(96)00014-7zbMATH Open0857.68020OpenAlexW1995509029MaRDI QIDQ1126263FDOQ1126263

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

Recommendations

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

zbMATH Keywords

language processors

Mathematics Subject Classification ID

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

Cited In (6)

• Proof-directed program transformation: a functional account of efficient regular expression matching
• Efficient memo-table management strategies
• 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)