The incremental-parser package
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
This package defines yet another parser 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, the parser can provide it incrementally, before the complete input is parsed.
|Versions||0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.2.3.1, 0.2.3.2, 0.2.3.3, 0.2.3.3, 0.2.3.4, 0.2.4, 0.2.4.1, 0.2.5|
|Change log||None available|
|Dependencies||base (<5), monoid-subclasses (<0.4) [details]|
|Copyright||(c) 2011-2013 Mario Blazevic|
|Source repository||head: darcs clone http://code.haskell.org/SCC/|
|Uploaded||Tue Sep 9 04:37:09 UTC 2014 by MarioBlazevic|
- incremental-parser-0.2.3.3.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees