Home Page
Categories: Regular expressions
Latest version: 1.1.1
Added 2005-10-24
Regular expression library for textual pattern matching based on the finite state automaton theory.
The matching algorithm is optimized for the processing of big input texts and big patterns. The regular expression syntax is extended by set operations (union, intersection, difference, complement) for pattern combination. Compiled patterns can be serialized for later use. With jrexx-Lab there is a graphical tool for examining a pattern while processing an input text. With jrexx-Lite there is a 23KB JAR file for use in embedded systems.
Built for Java |
Library |
Free or free version available |
Source code provided |