Quick and dirty parser for simple regular expressions, written in Python as a weekend project (while reading through the red dragon book). Converts regex to syntax tree, generates non-deterministic finite automaton, then deterministic finite autamaton.
For example, here is the parse output and the diagrams of non-deterministic and deterministic finite autamata generated for a|(bc)+d.
