The incremental-parser package

[Tags:benchmark, gpl, library, test]

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.


Versions 0.1, 0.2, 0.2.1, 0.2.2, 0.2.3,,,,, 0.2.4,
Dependencies base (<5), monoid-subclasses (<0.5) [details]
License GPL
Copyright (c) 2011-2015 Mario Blazevic
Author Mario Blazevic
Stability Unknown
Category Parsing
Home page
Source repository head: git clone
Uploaded Fri Dec 4 03:07:42 UTC 2015 by MarioBlazevic
Distributions Arch:, Debian:, LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 2068 total (23 in the last 30 days)
0 []
Status Docs available [build log]
Last success reported on 2015-12-04 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees