jrexx: automat. based regex api for Java / News: Recent posts

A new version (1.1.1) of jrexx-Lab - The Laboratory for Regular Expression Analysis - is released. With jrexx-Lab you can qickly create, edit, analyze and test regular expressions graphically (Webstart it at http://jrexx.sf.net\).
Version 1.1.1 is a bug fix release. jrexx-Lab is build upon the jrexx API, an automaton based Regular Expression API for Java, hosted on Sourceforge.

jrexx provides an automaton based regular expression api for Java including a very fast matching alogrithm, an extended pattern syntax (with set operations for complement, union, intersection, difference) and introspection of the automaton's structure. Release 1.1.1 added Serialization support for Automatons and a lightweight Pattern Matching Class DFASet that works with a serialized automaton.

i am working on the new release jrexx1.1 and hope it will be ready during this month.
This release is the one jrexx lab (current version)already uses, but it is not stable in terms of its interface yet.
with jrexx1.1 you will be able to load and save automatons.
essentially this is only a side effekt, because the main purpose is to provide a simple representation of the automaton (a kind of value object) that is serializable and will be "xml-able" in future. this representation should be the fundament for the interchange of automatons between different apps/tools.
for example, jrexx lab's load and safe functionality works with this simple representation Object. so you can visualize and test automatons with jrexx lab even if the automatons are not build with the jrexx api.... read more

jrexx-Lab, a GUI frontend to jrexx - automaton based regular expression API for java - is available at http://www.karneim.com/jrexxlab. This is the first free application that is build upon jrexx.

FEATURES:
* creation and editing of regular expressions (based on JREXX regex strings)
* graphical representation of regular expressions as finite state automaton graphs
* testing environment for checking stepwise processing of input strings
* set operations on regular expressions (unify, intersect, substract, complement)
* minimizing of automatons
* interactive layout manipulation of the automaton graph (move, scroll, zoom)
* usage of simple 'relax' alogrithm to untangle the automaton graph
* printing
* load and save

To get a brief impression of the jrexx library in application, check out the demo applet at http://jrexx.sf.net/project01/jrx_demo.htm

http://jrexx.sf.net has got a new design and more information now.

You can download the jar file in the files section.
For a really quick quickstart see the project homepage at http://jrexx.sf.net.