Skip to content
NFA and DFA implementation in Java
Branch: master
Clone or download
Latest commit 1455d22 Feb 11, 2017
Type Name Latest commit message Commit time
Failed to load latest commit information.
resources changes to get up-to-date with current local version: removed Jython … Dec 25, 2015
tests/src fixed branch specific bug in attaching subinfos to states Feb 21, 2016
.gitignore set up of javadoc and test coverage Dec 27, 2015
LICENSE wrongly imported Jan 15, 2012 removed dead links Feb 11, 2017
build.xml 2.0.0: Additional syntax features for the regex parser Feb 7, 2016

monqjfa --- Nondeterministic and Deterministic Finita Automata for Java (NFA, DFA)

The Java class library monq.jfa provides fast and flexible text filtering with regular expressions. In contrast to java.util.regex, monq.jfa allows a regular expression to be bound to an action that is automatically called whenever a match is spotted in an input stream.

In addition it is possible to combine several tenthousand regex/action pairs into one machinery (called DFA). The DFA filters input to output by looking for matches of all regular expressions in parallel, calling their actions to reformat the text or to incrementally built up a data structure.

Release Notes:


regular expression syntax:


©2007--2016 by Harald Kirsch

You can’t perform that action at this time.