Re: [Haskell-cafe] performance question

On Wed, Feb 13, 2013 at 5:45 PM, wrote:

...

On 13.02.2013 21:41, Brandon Allbery wrote:

...

The native solution is a parser like parsec/attoparsec.

"Aleksey Khudyakov" replied

...

Regexps only have this problem if they are compiled from string. Nothing prevents from building them using combinators. regex-applicative[1] uses this approach and quite nice to use.

[1] http://hackage.haskell.org/package/regex-applicative

That _is_ a nice package, but it _is_ 'a parser like parsec/attoparsec'.

Well, yes; it's a case in point. -- brandon s allbery kf8nh sine nomine associates allbery.b@gmail.com ballbery@sinenomine.net unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net