Project Summary
A regular expressions parser that uses a deterministic finite automata, rather than the more common non-deterministic finite automata utilized by most regexp engines. This give assured per-character processing time, and is ideal for cases where the regular expression needs a small amount of state per string, and rarely changes. This is ideal for firewalls and intrusion detection.
In a Nutshell, Deterministic Finite Automata...
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
65% of companies leverage OSS to speed application development in 2016
-
...
anyone with an Open Hub account can update a project's tags
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
check out hot projects on the Open Hub