正则表达式转化为DFA。首先转化为逆波兰表达式。再建立语法分析树，求firstops,followops,lastops,nullable函数，构建DFA。-Regular expressions into DFA. First into reverse Polish notation. Re-establishing the parse tree, seeking firstops, followops, lastops, nullable function, build DFA.