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]
Versions 0.1, 0.2, 0.3
Change log changelog.md
Dependencies base (<5), bytestring [details]
License BSD-3-Clause
Copyright (c) Yuras Shumovich 2016
Author Yuras Shumovich
Maintainer shumovichy@gmail.com
Category Parsing
Home page https://github.com/Yuras/scanner
Source repo head: git clone git@github.com:Yuras/scanner.git
Uploaded by YurasShumovich at Sun Apr 3 17:52:54 UTC 2016
Distributions LTSHaskell:0.2, NixOS:0.3, Stackage:0.3
Downloads 1936 total (66 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for scanner-0.2

[back to package description]

scanner

Fast non-backtracking incremental combinator parsing for bytestrings

Build Status

On hackage: http://hackage.haskell.org/package/scanner

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: https://github.com/Yuras/scanner/tree/master/examples/Redis

Benchmark results:

Bechmark results

But if you really really really need backtracking, then you can just inject attoparsec parser into a scanner: http://hackage.haskell.org/package/scanner-attoparsec