scanner: Fast non-backtracking incremental combinator parsing for bytestrings

[ bsd3, library, parsing ] [ Propose Tags ]

Parser combinator library designed to be fast. It doesn't support backtracking.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS] 0.1, 0.2, 0.3, 0.3.1
Change log
Dependencies base (<5), bytestring, fail [details]
License BSD-3-Clause
Copyright (c) Yuras Shumovich 2016
Author Yuras Shumovich
Category Parsing
Home page
Source repo head: git clone
Uploaded by YurasShumovich at 2019-09-18T13:58:34Z
Distributions Debian:0.3.1, LTSHaskell:0.3.1, NixOS:0.3.1, Stackage:0.3.1
Reverse Dependencies 6 direct, 144 indirect [details]
Downloads 9908 total (55 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-09-18 [all 1 reports]

Readme for scanner-0.3.1

[back to package description]


Fast non-backtracking incremental combinator parsing for bytestrings

Build Status

On hackage:

On stackage:

It is often convinient to use backtracking to parse some sophisticated input. Unfortunately it kills performance, so usually you should avoid backtracking.

Often (actually always, but it could be too hard sometimes) you can implement your parser without any backtracking. It that case all the bookkeeping usuall parser combinators do becomes unnecessary. The scanner library is designed for such cases. It is often 2 times faster then attoparsec.

As an example, please checkout redis protocol parser included into the repo, both using attoparsec and scanner libraries:

Benchmark results:

Bechmark results

But if you really really really need backtracking, then you can just inject attoparsec parser into a scanner: