Due Monday, October 27
Write an algorithm that inputs an arbitrary context free grammar (which you can assume has no useless symbols) and produces the CFSM for this grammar.
One thing to think about is how one can display the CFSM. An initial satisfactory attempt would be to simply be able to input a state number and have that state printed with its rules.
A better, but certainly much more involved approach would be to be able to click on a label that labels an edge leaving that state and have the next state printed (event driven programming).