Welcome![Sign In][Sign Up]
Location:
Search - program nfa be dfa

Search list

[ELanguage[NFA+TO+DFA]

Description: [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
Platform: | Size: 149504 | Author: 三块一 | Hits:

[ELanguage805NFA

Description: [用Java语言实现nfa到DFA的等价变换.rar] - 本程序为编译原理里的一个重要的知识点,实现nfa到DFA的转换 [nfatoDFA.rar] - nfa转化为DFA的一个程序!希望能有点作用! [REManageAndnfaToDFA.rar] - 能够完成正规式到nfa的转换,NFA到DFA的转换(子集法),DFA的最小化,测试一个生成串是否能为生成的DFA所识别 -[Using Java language to the DFA' s nfa equivalent transformation. Rar]- This procedure is compiled in an important principle of knowledge, the realization of nfa to DFA conversion [nfatoDFA.rar]- nfa into a DFA program! Hope role can be a little bit! [REManageAndnfaToDFA.rar]- to the completion of the formal ceremony to nfa conversion, NFA to DFA conversion (a subset of the Law), DFA minimization, testing whether a string can be generated for the generated DFA identified
Platform: | Size: 10240 | Author: 董华鹏 | Hits:

[OtherNFAtoDFA[J.S]

Description: 一个NFA转化为DFA的带有界面的程序,C++builder编写,能够输出转化子集;对于多终结符的情况也一样能够正确求解。-An NFA into a DFA with the interface of the program, C++ builder write to a subset of the output conversion for multi-terminator is also the case can be properly solved.
Platform: | Size: 1088512 | Author: 卓然 | Hits:

[ELanguageLexicalAnalyzer

Description: 手工构造一个能够识别C语言的所有典型单词,如:标识符、数字、运算符,和if、while等保留字的确定有限自动机,并写出对应该自动机的程序;然后以一个简化的C语言程序为输入文件,通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表,并以文件形式保存结果(也就是TOKEN序列)。 将自己定义的各个正则表达式转化为NFA,然后将其综合为NFA ,再将NFA 转化为DFA,再将DFA转化为最少状态的DFA ,最后由DFA 转化为词法分析程序。-Manually construct a C language to identify all the typical words such as: identifiers, numbers, operators, and if, while the determination of reserved words such as finite automata, and write on the procedure should be automatic machine then a simplified C language program for the input file, through the design of automata based on the lexical analysis procedure for obtaining the input file and within each code word table, and save the results to file the form (that is, TOKEN sequence). Defining themselves in all the regular expression into NFA, and then consolidated for the NFA ' , then NFA' into a DFA, DFA then converted to a minimum state DFA ' , the last by the DFA' into a lexical analysis program.
Platform: | Size: 337920 | Author: 罗丹 | Hits:

[JSP/Java1

Description: DFA、NFA的java代码实现,代码简单易懂,并附有可以运行的脚本文件,以及程序的说明文档-DFA, NFA' s java code, easy-to-understand code, with a script file that can be run, as well as the program' s documentation
Platform: | Size: 4096 | Author: 付波澜 | Hits:

CodeBus www.codebus.net