Another thing that may be of interest is that parser generators can guarantee you complexity bounds of parsing time (as usual, the goal is linear).
Some of the conflicts that annoy us about parser generators are often hints on this topic; if the parser generator succeeds, you are guaranteed to have a linear parser. If backtracking is allowed in parser combinators, it is comparatively easy to get that wrong. Niklas _______________________________________________ ghc-devs mailing list ghc-devs@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/ghc-devs
