Graphs from Context-Free Grammars.
Project description
GrammarGraph
Creating graphs from context-free grammars for fun and profit.
Features
- Creating sub graphs
- Export back to grammars
- Reachability
- Filter abstraction
- Dijkstra's algorithm for shortest paths between nodes
- Checking whether a (sub) graph represents a tree
- Computing k-paths (paths of exactly length k) in grammars and derivation trees, and a k-path coverage measure (see this paper) of derivation trees based on that.
Have a look at our feature demo!
Install
GrammarGraph requires at least Python 3.9.
We recommend to install GrammarGraph in a virtual environment. Example usage (inside project directory):
python3 -m venv venv
source venv/bin/activate
pip install -r requirements.txt
# Run tests
python3 -m pytest -n 16
Author: Dominic Steinhöfel.
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
grammar_graph-0.1.15.tar.gz
(51.9 kB
view hashes)
Built Distribution
Close
Hashes for grammar_graph-0.1.15-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 98358d120257f6ddd52d84cb40195cd3915244d7b919307bafce5f05d6dceda0 |
|
MD5 | 9a69184f6928c91e03672031952fdd3e |
|
BLAKE2b-256 | 05d362f42bd323750c1bdb186d3a41bb2bd68bec6a4e25ef35c5159988d3f895 |