# Parser combinators

[![License BSD3](https://img.shields.io/badge/license-BSD3-brightgreen.svg)](http://opensource.org/licenses/BSD-3-Clause)
[![Hackage](https://img.shields.io/hackage/v/parser-combinators.svg?style=flat)](https://hackage.haskell.org/package/parser-combinators)
[![Stackage Nightly](http://stackage.org/package/parser-combinators/badge/nightly)](http://stackage.org/nightly/package/parser-combinators)
[![Stackage LTS](http://stackage.org/package/parser-combinators/badge/lts)](http://stackage.org/lts/package/parser-combinators)
[![Build Status](https://travis-ci.org/mrkkrp/parser-combinators.svg?branch=master)](https://travis-ci.org/mrkkrp/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](https://github.com/mrkkrp/megaparsec).

## Contribution

Issues, bugs, and questions may be reported in [the GitHub issue tracker for
this project](https://github.com/mrkkrp/parser-combinators/issues).

Pull requests are also welcome and will be reviewed quickly.

## License

Copyright © 2017–2019 Mark Karpov

Distributed under BSD 3 clause license.