utility to convert regular grammars to non-deterministic finite automata and vice versa
To compile, just run make.
To run, ./rg2nfa input_file [output_file], where the input_file has one of the following extensions: gr or dot.
esneider/ITBA_TLA_12_rg2nfa
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Utility to convert regular grammars to non-deterministic finite automata and vice versa
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published