Parser from regular expression to NFA
This project comes from the inspiration I got from taking the course CSC240, Intro to the Theory of Computation, at University of Toronto. I decided to make something practical after reading the proofs about the equivalence of regular expressions and finite state automaton.
The parser can take in any valid regular expression involving (,),*,., or just juxtuposition in place. The alphabet the regular expression is over is configurated in the constructor of the Parser class. The notation is definitely not standard in regular expression libraries, but I wanted it to resemble the course content.
Here's a demo of the proram.
