This program compiles regular expressions (regexes) written in the modified ECMAScript regex grammar into modular nondeterministic finite automata suitable for hardware acceleration.
This was originally an extended re-implementation of the "front-end" part in the following paper:
https://www.computer.org/csdl/proceedings/reconfig/2008/3474/00/3474a073-abs.html
It has since grown to include conversion of a set of NFAs to a DFA; compilation of NFAs to instruction suitable for simulation; and compilation of a DFA to hash-based data structures for a simulator.
Categories
MathematicsLicense
GNU Library or Lesser General Public License version 3.0 (LGPLv3)Follow RegexToNFA
Other Useful Business Software
$300 in Free Credit Towards Top Cloud Services
Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of RegexToNFA!