Using memorization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers

Authors:
R. A. Frost
Affiliations:
School of Computer Science, University of Windsor, Windsor, Ontario, Canada N9B 3P4
Venue:
ACM SIGPLAN Notices
Year:
1994

Lazy memo-functions

Proc. of a conference on Functional programming languages and computer architecture
Guarded attribute grammars

Software—Practice & Experience
Supporting the Attribute Grammar Programming Paradigm in a Lazy Funciontal Programming Language

Functional Programming, Concurrency, Simulation and Automated Reasoning: International Lecture Series 1991-1992, McMaster University, Hamilton, Ontario, Canada
Techniques for automatic memoization with applications to context-free parsing

Computational Linguistics

Parser combinators for ambiguous left-recursive grammars

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
A type system for reflective program generators

Science of Computer Programming

Hi-index	0.00