parser-combinators

Lightweight package providing commonly useful parser combinators

https://github.com/mrkkrp/parser-combinators

Version on this page:0.3.0
LTS Haskell 24.18:1.3.0@rev:1
Stackage Nightly 2025-11-04:1.3.0@rev:1
Latest on Hackage:1.3.0@rev:1

See all snapshots parser-combinators appears in

BSD-3-Clause licensed and maintained by Mark Karpov
This version can be pinned in stack with:parser-combinators-0.3.0@sha256:493a4357d1f542125be2de462e168de371ca35fce18311fb1fe7f0cc3a389bda,1479

Module documentation for 0.3.0

Depends on 1 package(full list with versions):
base
Used by 2 packages in nightly-2017-12-27(full list with versions):
megaparsec, mmark

Parser combinators

License BSD3 Hackage Stackage Nightly Stackage LTS Build Status

The package provides common parser combinators defined in terms of Applicative and Alternative without any dependencies but base. 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

Copyright © 2017 Mark Karpov

Distributed under BSD 3 clause license.

Changes

Parser combinators 0.3.0

  • Added the skipCount combinator.

  • Improved algorithmic efficiency of the count' combinator.

Parser combinators 0.2.1

  • Removed the byte order marking at the beginning of the Control.Applicative.Permutations module.

Parser combinators 0.2.0

  • Added Control.Applicative.Combinators.NonEmpty module that exports non-empty list versions of combinators that cannot return empty lists.

  • Added Control.Applicative.Permutations module that provides generalized permutation parser combinators.

Parser combinators 0.1.0

  • Initial release.