BSD Portsdevel/py-spark-parser 1.9.0 DragonFly
Earley-Algorithm Context-free grammar Parser Toolkit
- System
- DragonFly
- Repository
- DPorts
- Maintainer
- [email protected] (as in FreeBSD)
- License
- MIT
- Categories
- devel, python
- Package size
- 100.7 KiB, 597.7 KiB installed
Description
This package 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.
(SPARK stands for Scanning, Parsing, and Rewriting Kit. It is a poor name since it conflicts with a more popular package of the same name. In the future we will rename this.)
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.
In the other systems
The newest version among them is 1.9.0, as upstream numbers it.
| System | Port | Version | Vulnerabilities | Status | Maintainer | Last update |
|---|---|---|---|---|---|---|
| DragonFly | devel/py-spark-parser | 1.9.0 newest | none known | - | [email protected] | - |
| FreeBSD | devel/py-spark-parser | 1.9.0 newest | none known | - | [email protected] | - |
| OpenBSD | devel/py-spark-parser | 1.9.0p0 newest | no data | - | The OpenBSD ports mailing-list <[email protected]> | 2026-08-11 |
| NetBSD | lang/py-spark-parser by name | 1.9.0nb1 newest | none known | - | [email protected] | - |
| HardenedBSD | devel/py-spark-parser | 1.9.0 newest | no data | - | [email protected] | - |
| GhostBSD | devel/py-spark-parser | 1.9.0 newest | no data | - | [email protected] | - |
Install
Binary package:
pkg install py311-spark-parserFrom DPorts:
cd /usr/dports/devel/py-spark-parser && make install cleanDependency graph
Ports that need it on the left, what it needs to run on the right; at most 8 of each. "Dependencies" below lists them all.