parser-combinators: Lightweight package providing commonly useful parser combinators

Versions [RSS]	0.1.0, 0.2.0, 0.2.1, 0.3.0, 0.4.0, 1.0.0, 1.0.1, 1.0.2, 1.0.3, 1.1.0, 1.2.0, 1.2.1, 1.3.0
Change log	CHANGELOG.md
Dependencies	base (>=4.8 && <5.0), semigroups (>=0.18 && <0.19) [details]
License	BSD-3-Clause
Author	Mark Karpov <markkarpov92@gmail.com> Alex Washburn <github@recursion.ninja>
Maintainer	Mark Karpov <markkarpov92@gmail.com>
Category	Parsing
Home page	https://github.com/mrkkrp/parser-combinators
Bug tracker	https://github.com/mrkkrp/parser-combinators/issues
Source repo	head: git clone https://github.com/mrkkrp/parser-combinators.git
Uploaded	by mrkkrp at 2019-01-01T06:18:58Z
Distributions	Arch:1.3.0, Debian:1.2.1, Fedora:1.3.0, LTSHaskell:1.3.0, NixOS:1.3.0, Stackage:1.3.0, openSUSE:1.3.0
Reverse Dependencies	71 direct, 637 indirect [details]
Downloads	49135 total (259 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-01-01 [all 1 reports]

Readme for parser-combinators-1.0.1

[back to package description]

Parser combinators

The package provides common parser combinators defined in terms of Applicative and Alternative without any dependencies but base. There are also more efficient versions of the combinators defined in terms of Monad and MonadPlus. Test suite and benchmarks can be found in the Megaparsec repo.

Contribution

Issues, bugs, and questions may be reported in the GitHub issue tracker for this project.

Pull requests are also welcome and will be reviewed quickly.

License

Distributed under BSD 3 clause license.