incremental-parser: Generic parser library capable of providing partial results from partial input.

[ gpl, library, parsing ] [ Propose Tags ] [ Report a vulnerability ]

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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.4, 0.2.4, 0.2.4.1, 0.2.5, 0.2.5.1, 0.2.5.2, 0.2.5.3, 0.2.5.4, 0.3, 0.3.1, 0.3.1.1, 0.3.2, 0.3.2.1, 0.3.2.2, 0.3.3, 0.4, 0.4.0.1, 0.4.0.2, 0.5, 0.5.0.1, 0.5.0.2, 0.5.0.3, 0.5.0.4, 0.5.0.5, 0.5.1
Dependencies base (<5), monoid-subclasses (<0.4) [details]
Tested with ghc >=0
License LicenseRef-GPL
Copyright (c) 2011-2013 Mario Blazevic
Author Mario Blazevic
Maintainer blamario@yahoo.com
Category Parsing
Home page http://patch-tag.com/r/blamario/incremental-parser/wiki/
Source repo head: darcs get http://code.haskell.org/SCC/
Uploaded by MarioBlazevic at 2014-09-09T04:37:23Z
Distributions Arch:0.5.1, Debian:0.4.0.2, LTSHaskell:0.5.1, NixOS:0.5.1, Stackage:0.5.1
Reverse Dependencies 5 direct, 10 indirect [details]
Downloads 20681 total (152 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]