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.8.tar.gz
(46.2 kB
view hashes)
Built Distribution
Close
Hashes for grammar_graph-0.1.8-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 441940911b4dc9aaabff649da4e1436737597790fc2c0580ca048638ac9d276b |
|
MD5 | cb0184720d067d8dcc510ce2931ea103 |
|
BLAKE2b-256 | aaa0254db37e5183422327eaf66bc9e468eab979db615ca94e51f728af6b2e14 |