[Haskell-cafe] Re: Optimizing Parsec 3 -- was: Wiki software?

Iavor Diatchki iavor.diatchki at gmail.com
Wed Dec 16 14:26:51 EST 2009

Hi everyone,
While you are discussing performance of parsing combinator libraries,
I though I'd mention "parsimony", available from Hackage.  It has as
good performance as parsec v2 but it also has support for different
buffer types (e.g., byte strings, including support for utf8 decoding,
etc) which is similar to parsec v3.  I also think that it has a
slightly simpler API.

On Wed, Dec 16, 2009 at 4:45 AM, Stephen Tetley
<stephen.tetley at gmail.com> wrote:
> Hi Jason
> UU parsing somewhat invented the Applicative style - it defined the
> usual combinators from Control.Applicative (<$>), (<*>), (<*), (*>)
> etc. but didn't have an 'Applicative' type class.
> By obligation, I mean relying only on the Applicative class for the
> derived operations, here manyTill, choice etc.
> Best wishes
> Stephen
> 2009/12/16 Jason Dusek <jason.dusek at gmail.com>:
> ...
>>  Is UU parsing more "Applicative aware", then?
>>  When you say "obligation", what do you mean?
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe

More information about the Haskell-Cafe mailing list