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
Failed Payment Recovery for Subscription Businesses Icon
Failed Payment Recovery for Subscription Businesses

For subscription companies searching for a failed payment recovery solution to grow revenue, and retain customers.

FlexPay’s innovative platform uses multiple technologies to achieve the highest number of retained customers, resulting in reduced involuntary churn, longer life span after recovery, and higher revenue. Leading brands like LegalZoom, Hooked on Phonics, and ClinicSense trust FlexPay to recover failed payments, reduce churn, and increase customer lifetime value.
Learn More
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