A monadic parser combinator written purely in python
Project description
parsemon2
This is yet another attempt to bring monadic parsing to python. The problem the author saw with many other implementations is a limit to their composability. A lot of the times these otherwise quite well written implementations suffer pretty bad from pythons lack of TCO. This implementation uses trampolines to get around that.
Right now this implementation is nothing more but a toy, but the tests that come with this package show already that it’s parsing ability is not dependent on pythons recursion limit.
We also have error messages.
Changes
1.1
Implement validators
chain now accepts 1 or more arguments
Implement do notation
New whitespace parser
New parser for integers
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
File details
Details for the file parsemon2-1.1.tar.gz.
File metadata
- Download URL: parsemon2-1.1.tar.gz
- Upload date:
- Size: 7.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/1.11.0 pkginfo/1.4.2 requests/2.19.1 setuptools/40.2.0 requests-toolbelt/0.8.0 tqdm/4.25.0 CPython/3.6.6
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 51bf761a4e1745b934d61df7c7ac7d880110f905006f6d11fa686262c1c92a63 |
|
| MD5 | 4df6b76d92d5e2dc90d9181ee89f4f26 |
|
| BLAKE2b-256 | 8bd4e1bfebc412f7c68f2cdd137fe8ebcf8513e04d7670361e9776f7ec62757c |
