mrkkrp/megaparsec
1
1
Fork 0
mirror of https://github.com/mrkkrp/megaparsec.git synced 2024-12-01 02:47:13 +03:00
Code Issues Projects Releases Wiki Activity
Industrial-strength monadic parser combinator library
265 Commits 6 Branches 55 Tags 3.3 MiB
Haskell 98.8%
Nix 1.2%
4c1858f900
Go to file
mrkkrp 4c1858f900 fix a typo: it's called ‘token’ now
2015-09-14 22:44:34 +06:00
benchmarks Add a few synthetic benchmarks 2015-09-10 18:11:46 +02:00
old-tests fixed the failing old test 2015-09-11 15:10:14 +06:00
tests make ‘Text.Megaparsec.Prim.token’ more flexible 2015-09-14 14:15:31 +06:00
Text fix a typo: it's called ‘token’ now 2015-09-14 22:44:34 +06:00
.gitignore refresh ‘.gitignore’ 2015-09-11 14:20:01 +06:00
.travis.yml travis: run 1000 iterations per test 2015-09-13 21:21:43 +06:00
AUTHORS.md extend the list of contributors 2015-09-14 21:26:26 +06:00
CHANGELOG.md added more case-insensitive character parsers 2015-09-06 15:17:37 +06:00
LICENSE.md renamed ‘MegaParsec’ → ‘Megaparsec’, close #10 2015-08-01 22:24:45 +06:00
megaparsec.cabal Merge branch 'new-lexer' 2015-09-13 21:16:39 +06:00
megaparsec.ebal use two threads for local testing 2015-08-09 00:49:30 +06:00
README.md correct a typo and clean up description 2015-08-26 17:57:33 +06:00
Setup.hs Initial import 2008-01-13 17:53:15 +00:00

README.md

Megaparsec

Note that this is work in progress.

License BSD3 Build Status Coverage Status

This is industrial-strength monadic parser combinator library. Megaparsec is a fork of Parsec library originally written by Daan Leijen.

Megaparsec is different from Parsec in the following ways:

  • Better error messages. We test our error messages using dense QuickCheck tests. Good error messages are just as important for us as correct return values of our parsers. Megaparsec will be especially useful if you write compiler or interpreter for some language.

  • Some quirks and “buggy features” (as well as plain bugs) of original Parsec are fixed. There is no undocumented surprising stuff in Megaparsec.

  • Better support for Unicode parsing in Text.Megaparsec.Char.

  • Megaparsec has more powerful combinators and can parse languages where indentation matters.

  • Comprehensive QuickCheck test suite covering nearly 100% of our code.

  • We have benchmarks to detect performance regressions.

  • Better documentation, with 100% of functions covered, without typos and obsolete information, with working examples. Megaparsec's documentation is well-structured and doesn't contain things useless to end user.

  • Megaparsec's code is clearer and doesn't contain “magic” found in original Parsec.

  • Megaparsec looks into the future, it does not contain code that serves for compatibility purposes, it also requires more recent version of base.

Contributing

Issues (bugs, feature requests or otherwise feedback) may be reported in the Github issue tracker for this project.

Pull-requests are also welcome (and yes, they will get attention and will be merged quickly if they are good, we are progressive folks).

Spread the Word

Many people still don't know about Megaparsec, you can help the project by writing about it in a blog, creating a tutorial or something like that. This is highly appreciated.

License

Copyright © 2015 Megaparsec contributors
Copyright © 2007 Paolo Martini
Copyright © 1999–2000 Daan Leijen

Distributed under BSD3 license.