DFA library is a regular expression library capable of the classic RE syntax (i.e. - without any perl extension). Unlike many other libraries with similar functionality, a deterministic finite automata (DFA) is used. DFA was formerly called npcre, wh
License
GNU Library or Lesser General Public License version 2.0 (LGPLv2)Follow Deterministic Finite Automata
You Might Also Like
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Deterministic Finite Automata!