Home

A java regular expression processor using finate state automatons. By the use of fsa's, it is possible to evaluate the expression character by character, and it is possible to branch the execution to support evaluating against other character sources than a simple string, for example against a trie.

An other advantage of fsa's is that the memory usage only depends on the complexity of the expression, not on the character input it is evaluated against.

The syntax of the regexps is not as complete as the standard java regexps, but it can easily be expanded.

Project Members:

• Matthias Sprünglin (admin)