查看会员资料
用 户 名:YAN****
发送消息- Email:用户隐藏
- Icq/MSN:
- 电话号码:
- Homepage:
- 会员简介:
最新会员发布资源
wenjain1
- 正则表达式转化为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.