Ocaml DFA Parser
Problem 1 Let us write a compiler that translates regular expressions to deterministic finite automata (DFAs). 2. Youcanfindthefollowingfiles: • main.ml: Driver code with some test cases. You can add your own test cases here. • regex.ml: The definition of regular expressions (the “source lan- guage” of our compiler). • nfa.ml: NFA implementation (the “intermediate representation” …