> Thaddeus L Olczyk wrote:
>> Any references/libraries to combinator parsing ( ala Hutton and
>> Meijer mostly, but some Wadler ) in Scheme out there?
Abstraction and Performance from Explicit Monadic Reflection
Jonathan Sobel Erik Hilsdale and R. Kent Dybvig Daniel P. Friedman
Abstract
Much of the monadic programming literature gets the types right but
the abstraction wrong. Using monadic parsing as the motivating example,
we demonstrate standard monadic programs in Scheme, recognize how they
violate abstraction boundaries, and recover clean abstraction crossings
through monadic reflection. Once monadic reflection is made explicit,
it is possible to construct a grammar for monadic programming. This
grammar, in turn, enables the redefinition of the monadic operators
as macros that eliminate at expansion time the overhead imposed by
functional representations. The result is very efficient monadic programs;
for parsing, the output code is competitive with good hand-crafted parsers.
http://www.cs.indiana.edu/~jsobel/Parsing/explicit.html
Stone's:
http://www.math.grin.edu/~stone/courses/languages/monads.ps
?
And Oleg's piece on monads (but nothing about parsing here)
http://okmij.org/ftp/Scheme/monad-in-Scheme.html
--
Jens Axel Søgaard
