Visual FA: A DFA Regular Expression Engine w/ Lexing

Visual FA is a project that provides a much faster alternative to Microsoft's regular expression engine when you don't need backtracking and anchors. It is also capable of lexing. This engine exposes its inner workings such that you can tinker with your expressions and the state machines they generate, and then graph, search, transform, alter, match, or lex with the result. You can also compile or generate code from expressions.