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

Tags

No tags have been added

In a Nutshell, Deterministic Finite Automata...

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

Languages

Languages?height=75&width=75
C++
59%
XML
21%
Python
13%
4 Other
7%

30 Day Summary

Jun 23 2016 — Jul 23 2016

12 Month Summary

Jul 23 2015 — Jul 23 2016

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!