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

Version on this page:
LTS Haskell 20.26:
Stackage Nightly 2022-11-17:
Latest on Hackage:

See all snapshots incremental-parser appears in

LicenseRef-GPL licensed by Mario Blazevic
Maintained by
This version can be pinned in stack with:incremental-parser-,2075

Module documentation for

  • Control
    • Control.Applicative
      • Control.Applicative.Monoid
  • Text
    • Text.ParserCombinators
      • Text.ParserCombinators.Incremental
        • Text.ParserCombinators.Incremental.LeftBiasedLocal
        • Text.ParserCombinators.Incremental.Symmetric
Used by 1 package in lts-0.7(full list with versions):

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.