Deterministic Finite Automata

I Use This!

Activity Not Available

Analyzed over 2 years ago. based on code collected over 2 years ago.

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...

...
has had 34 commits made by 2 contributors
representing 8,866 lines of code
...
is mostly written in C++
with a low number of source code comments
...
has a codebase with a long source history
maintained by nobody
with stable Y-O-Y commits
...
took an estimated 2 years of effort (COCOMO model)
starting with its first commit in December, 2005
ending with its most recent commit almost 9 years ago

Quick Reference

Homepage

(4 Locations)

This Project has No vulnerabilities Reported Against it

Did You Know...

...
Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
...
data presented on the Open Hub is available through our API
...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
...
you can embed statistics from Open Hub on your site