[Haskell-cafe] Eager Parser Combinators [was: Functional programming for processing of largeraster images]

[Greg Buchholz]

Ralf Hinze wrote:
> Also, in a non-strict language recursive definitions are not
> limited to function types. Users of parser combinators heavily rely
> on this feature. Just try to define/use parsing combinators
> ins a strict language.

    Anyone care to comment on what goes wrong with parser combinators in
an eager language?  Is it mainly a space usage problem (where the lazy
version might essentially perform a depth-first-search, while the eager
version is breadth-first)?  Or is there something else I'm missing?  

    As a reference, back when I was trying to understand monads, I
ported the parser combinators from the Hutton and Meijer paper to
perl...

    http://sleepingsquirrel.org/monads/parser/monad_parser.txt


Thanks,

Greg Buchholz