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

[ gpl, library, parsing ] [ Propose Tags ]

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.

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

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 (>=4.5 && <4.11), monoid-subclasses (<0.5) [details]
License LicenseRef-GPL
Copyright (c) 2011-2015 Mario Blazevic
Author Mario Blazevic
Maintainer blamario@yahoo.com
Revised Revision 1 made by HerbertValerioRiedel at 2019-05-31T14:19:09Z
Category Parsing
Home page https://github.com/blamario/incremental-parser
Source repo head: git clone https://github.com/blamario/incremental-parser
Uploaded by MarioBlazevic at 2015-12-04T03:07:42Z
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 19994 total (111 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-12-04 [all 1 reports]