从正则表达式到有穷自动机实例，最近刚学了编译原理 搞出来得这个东西-From regular expressions to finite automata instance, recently learned more this thing come up with compiler theory

this is a program made in borland c for a conversion of nfa to dfa