If you have been interested in the Microsoft GLEE graphing utility, and the full product MS AGL then you may have found it hard to locate further information. Help files and more are listed below: Continue reading →
In my previous post, I described how to parse a regular expression pattern into an abstract syntax representation. The next phase is to transform the parsed syntax into a finite state machine. I have chosen to model the FSM as a mathematical directional graph (digraph). This post describes the implementation of this module in preparation for the actual compilation step.