dfasyn is a tool for building general deterministic finite automata (DFAs) given a description as a non-determinstic finite automaton. In some areas it has more capabilities than lex/flex, e.g. iterated elements can be specified with constraints between them. However, there are several things that have to be done by hand with dfasyn that lex/flex users take for granted.
For the moment, the only documentation is the source code and any example inputs you come across. :-)
dfasyn is licensed under the GPL.
Suggestions, bug reports, experiences, praise, complaints etc to the author, please. (Apart from the obvious complaint of "where is the documentation?"!) To obtain my email address, see below (this obfuscation is to thwart spam harvesting).
SQUASH BACK INTO ONE LINE rc .org @rc0 .uk OR WRITE THIS BACKWARDS ku.gro.0cr@cr OR ROT13 THIS firstname.lastname@example.org
Version 0.3 was released on 28 April 2003. It's available in the following formats:
(Note, this is a clone of the most recent version that was embedded within my jbofihe project. I've separated it out into a separate project because I want to use it in conjunction with mairix.)