搜索资源列表
compiler
- 编译原理的词法分析器。可以解析正则表达式。生成NFA及DFA-Compilation Principle of lexical analyzer. Regular expressions can be resolved. Build NFA and DFA
zhengze
- 正则表达式及nfa到dfa再到mfa的转化-Regular expressions and nfa to dfa conversion and then to mfa
LexicalAnalyzer
- 手工构造一个能够识别C语言的所有典型单词,如:标识符、数字、运算符,和if、while等保留字的确定有限自动机,并写出对应该自动机的程序;然后以一个简化的C语言程序为输入文件,通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表,并以文件形式保存结果(也就是TOKEN序列)。 将自己定义的各个正则表达式转化为NFA,然后将其综合为NFA ,再将NFA 转化为DFA,再将DFA转化为最少状态的DFA ,最后由DFA 转化为词法分析程序。-Manually constr
Compile
- 词法分析器。对任何正则表达式,构造DFA,并画出DFA的图。需要Graphviz的画图软件配合-Lexical parsers. For any regular expressions, the tectonic DFA and draw the DFA picture
BY_work2
- 正则表达式转换成NFA最后转换成DFA~代码里注释的很清楚,希望能给大家帮助-Regular expressions to convert NFA finally converted into a DFA ~ code annotated clearly, I hope to give you help
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.
RextoNFA
- 实验正则表达式到NFA 由NFA到DFA,同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
B6MHjIFh
- 编译原理实验正则表达式到NFA 由NFA到DFA,同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation