38 views
Write a $Yacc$ program that takes regular expressions  (as defined by the grammar of Question $4.2.2(d)$,  but with any single character as an argument, not just a) and produces as output a  transition table for a nondeterministic finite automaton recognizing the same language.
| 38 views