incremental-parser

Generic parser library capable of providing partial results from partial input.

https://github.com/blamario/incremental-parser

Version on this page:	0.2.4.1
LTS Haskell 23.19:	0.5.1
Stackage Nightly 2024-12-09:	0.5.1
Latest on Hackage:	0.5.1

See all snapshots incremental-parser appears in

LicenseRef-GPL licensed by Mario Blazevic

Maintained by [email protected]

This version can be pinned in stack with:incremental-parser-0.2.4.1@sha256:dc15b0c11b6fe4854cbf9f4360b069ebc29cf61c6bf441180f2367217c9f8381,2500

Module documentation for 0.2.4.1

Control
- Control.Applicative
  - Control.Applicative.Monoid
Text
- Text.ParserCombinators
  - Text.ParserCombinators.Incremental
    - Text.ParserCombinators.Incremental.LeftBiasedLocal
    - Text.ParserCombinators.Incremental.Symmetric

Depends on 2 packages(full list with versions):

base, monoid-subclasses

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.