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.

Project Activity

See All Activity >

Categories

Mathematics

License

GNU Library or Lesser General Public License version 3.0 (LGPLv3)

Follow RegexToNFA

RegexToNFA Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of RegexToNFA!

Additional Project Details

Operating Systems

Linux

Intended Audience

Science/Research

Programming Language

C++

Related Categories

C++ Mathematics Software

Registered

2016-08-23