Open lawrancej opened 12 years ago
Write a visitor to convert each kind of regular expression to a finite automata
I got this bro!
Awesome! One concern: the FSM class as it is now is just a DFA. It's a minor change to make it an NFA, though.
Write a visitor to convert each kind of regular expression to a finite automata