An Earley-Algorithm Context-free grammar Parser Toolkit
Project description
SPARK - An Earley Algorithm Parser toolkit.
SPARK stands for Scanning, Parsing, and Rewriting Kit. It uses Jay Earley’s algorithm for parsing context free grammars, and comes with some generic Abstract Syntax Tree routines. There is also a prototype scanner which does its job by combining Python regular expressions.
The original version of this was written by John Aycock for his Ph.d thesis and was described in his 1998 paper: “Compiling Little Languages in Python” at the 7th International Python Conference. The current incarnation of this code is maintained (or not) by Rocky Bernstein.
Note: Earley algorithm parsers are almost linear when given an LR grammar. These are grammars which are left-recursive.
Installation
This uses setup.py, so it follows the standard Python routine:
python setup.py install # may need sudo # or if you have pyenv: python setup.py develop
Example
The github example directory has a worked-out examples; Package uncompyle6 uses this and contains a much larger example.
See Also
http://pages.cpsc.ucalgary.ca/~aycock/spark/ (Old and not very well maintained)
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 Distributions
Hashes for spark_parser-1.7.0-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 2e37554e5e3bae7fb6348c9df6874e613b8f63c754e1e270517456b663a35f33 |
|
| MD5 | 9a6b4910dae1f46bf4a4efa918a00022 |
|
| BLAKE2b-256 | 45c02037d95042429940f596734eb3619c7747ebd2f7a91a43a609262359024a |
