In feel free to completely disagree; it is easy to write a simple parser package, but designing one which gives nice error messages, corrects input instead of halting, can deal with ambiguous grammars, does not hang on to the input and produces results online wherever possible is not so easy.
By the way: the
http://hackage.haskell.org/package/ChristmasTree package contains template Haskell code which can be used to read printed Haskell data type valyes in LINEAR TIME, and knows how to deal with infix constructors without havimng to include swarms of extra parentheses which make the trivial parsers take exponential time.
Doaitse
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe