   NOTE: The files regex.c, regex.doc, regex2.c, and regex2.doc have been
renamed respectively nfa.c, nfa.doc, dfa.c. and dfa.doc.

  The source for RE -> DFA and RE -> NFA generating algorithms has been
provided for free with no restrictions.  To compile these programs you MUST
(absolutely must) have an ANSI-C compiler.  This software should compile on
any machine with an ANSI-C compiler.

   The following files have been included.

        readme ....... This file
        nfa.c ........ C-source for the RE -> NFA converter.
        nfa.doc ...... Documentation for the source and algorithm
        dfa.c ........ C-source for the RE -> DFA converter.
        dfa.doc ...... Modified documentation
        in* .......... Sample inputs
        out* ......... Sample outputs (generated by dfa.c)

The files in7 and out7 illustrate the full syntax (and illustrate that this
is NOT a CFG parsing utility, but show its potential for use as the basis for
one).

If the dfa (or nfa) program is compiled into an executable, named dfa (nfa),
then the files out1 and out2 would be generated as follows:

                        dfa <in1 >out1
                        dfa <in2 >out2

(similarily for nfa.c).

   Consider this software part of your development kit.  You can use it in your
projects any way you like with no licensing or copyright restrictions.  If
you'd like to try your hand at hacking it I encourage you to do so and to
distribute any substantial improvements you may come up in the same spirit
that this is being distributed: free of any restrictions.  Everything here is
new and original (as far as I can determine) and was generated over a 6 hour
period on 5/17/92 on my own time, and a 6 hour period on 5/17/93 on my own
time.

   Send comments and feedback to markh@csd4.csd.uwm.edu.  Direct correspondence
can also be sent to:

                    Mark Hopkins Consulting
                    2619 North Oakland Avenue, Suite 204
                    Milwaukee, Wisconsin 53211-3523
                    (414)332-8857
