easy-to-use parser combinators, for parsing in pure Python
Project description
Parsy is an easy way to combine simple, small parsers into complex, larger parsers. If it means anything to you, it’s a monadic parser combinator library for LL(infinity) grammars in the spirit of Parsec, Parsnip, and Parsimmon. But don’t worry, it has really good documentation and it doesn’t say things like that!
Parsy requires Python 3.3 or greater.
Links:
To contribute, please create a fork and submit a pull request on GitHub, after checking the “contributing” section of the docs. Thanks!
If you like parsy and think it should be better known, you could:
Star this project on GitHub.
Vote for it being included on awesome-python.
Parsy was originally written by Jeanine Adkisson, with contributions by other people as can be found in the git commit history.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for parsy-1.3.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | bea54186c3da470944dafe2314b57ac53d0dc2b0a168dc32f644b1b93dc6ca64 |
|
MD5 | fa5d5fd3e4ed7462f3127c86b54fb266 |
|
BLAKE2b-256 | 902a90f998cdeff98cbd6935eeab5a5a3d85ea4d90d494b0b450752a82093f63 |