scanner: Fast non-backtracking incremental combinator parsing for bytestrings
Parser combinator library designed to be fast. It doesn't support backtracking.
[Skip to Readme]
|Versions [faq]||0.1, 0.2, 0.3, 0.3.1|
|Dependencies||base (<4.13), bytestring [details]|
|Copyright||(c) Yuras Shumovich 2016|
|Revised||Revision 1 made by HerbertValerioRiedel at 2019-09-16T12:38:10Z|
|Source repo||head: git clone firstname.lastname@example.org:Yuras/scanner.git|
|Uploaded||by YurasShumovich at 2016-04-02T13:56:51Z|
|Distributions||Debian:0.2, LTSHaskell:0.3.1, NixOS:0.3.1, Stackage:0.3.1|
|Downloads||6710 total (180 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2016-11-27 [all 1 reports]
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'.
For package maintainers and hackage trustees