Memoizing Purely Functional Top-Down Backtracking Language Processors

@article{Frost1996MemoizingPF,
  title={Memoizing Purely Functional Top-Down Backtracking Language Processors},
  author={Richard A. Frost and Barbara Szydlowski},
  journal={Sci. Comput. Program.},
  year={1996},
  volume={27},
  pages={263-288}
}
Language processors may be implemented directly as functions. In a programming language that supports higher-order functions, large processors can be built by combining smaller components using higher-order functions corresponding to alternation and sequencing in the BNF notation of the grammar of the language to be processed. If the higher-order functions are defined to implement a top-down backtracking parsing strategy, the processors are modular and, owing to the fact that they resemble BNF… CONTINUE READING
8 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Report on the programming language Haskell , a non - strict , purely functional language , Version 1 . 2

  • P. Hudak, P. Wadler, +10 authors J. Young
  • ACM SIGPLAN Notices
  • 1995

Frost , Constructing programs as executable attribute grammars

  • A. R.
  • Comput . J .
  • 1988

Similar Papers

Loading similar papers…