Generic parser library capable of providing partial results from partial input.
|Version on this page:||0.2.4.1|
|LTS Haskell 20.23:||0.5.0.5|
|Stackage Nightly 2022-11-17:||0.5.0.4|
|Latest on Hackage:||0.5.0.5|
Maintained by firstname.lastname@example.org
This version can be pinned in stack with:
Module documentation for 0.2.4.1
This package defines yet another parser combinator library. This one is implemented using the concept of Brzozowski derivatives, tweaked and optimized to work with any monoidal input type. Lists, ByteString, and Text are supported out of the box, as well as any other data type for which the monoid-subclasses package defines instances. If the parser result is also a monoid, its chunks can be extracted incrementally, before the complete input is parsed.