The parsing problem is ubiquitous in Computer Science. Perhaps that is part of the reason it has been used so frequently to illustrate the power of continuations and monads. It is often the case, though, that the parser examples of continuation passing style and monads are top-down parsers. I intend to show that the continuation passing style of programming naturally leads to bottom-up or recursive ascent parsers. The programming language Scheme will be used to code example parsers.
Date of creation, presentation, or exhibit
Department, Program, or Center
Computer Science (GCCIS)
Proceedings of the 2003 international LISP conference. ACM
RIT – Main Campus