[Haskell-cafe] Re: Efficient parallel regular expressions

pierre k.pierre.k at gmail.com
Tue Nov 4 15:21:42 EST 2008

On Tue, Nov 04, 2008 at 08:34:37PM +0100, Achim Schneider wrote:
> Parsec is a thousand times more efficient for such things than regular
> expressions, and you can just lazily parse all the input into a list
> of data constructors and happily fold it into your state...

I would recommend you to use parsec too; my experience suggests that
parsec often results in much cleaner and readable implementation than
obscure regexps.


More information about the Haskell-Cafe mailing list