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
You Might Also Like
Our Free Plans just got better! | Auth0 by Okta
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of RegexToNFA!