Regular Expression Software

      Source and documentation for:


                      regular expression -> finite automata conversion,
                      regular language accquisition,
              and a grep-like filter using extended regular expression notation


are all available. The grep-like filter literally stands out on its own.
With the inclusion of the Interleave Product (A^B, e.g. ab^c = cab+acb+abc)
you have a notation so powerful that it can even process anagrams. For
example, running


            rex -i "<(n^a^p^o^l^e^o^n)>" /usr/dict/words


will find any anagram of Napoleon from the dictionary (the -i option makes
the search case-insensitive).


      All the methods used are a revival of the ancient Brzozowski methods,
heavily algebraic in nature, but which somehow fell into disuse before
the Modern Era (> 1964).


      Source can be obtained by contacting me at mark@freenet.uwm.edu
(or perhaps someone will be willing to devote some space at a FTP site?).
--

Return to the comp.compilers page.
Search the comp.compilers archives again.