搜索资源列表
newdfa
- nfa的确定化 NFAtoDFA也是编译原理中的算法，供大家参考 -nfa is NFAtoDFA determination of the principle of compiler algorithms, thank you for your consideration
NFAtoDFA[J.S]
- 一个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.
nfatodfa
- nfa 转化为 dfa 能够运行成功，我自己已经实验过了，欢迎下载-nfa dfa able to run into a success, I have experimented with, and welcome to download
NFAtoDFA
- 给出一个NFA，用代码实现到DFA的转换，编译原理-Give an NFA, with the code to DFA conversion, compiler theory
NFAtoDFA(CPP)
- 用c++编程求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 -C++ programming with regular expressions to find NFA (not sure of the finite automata), NFA to DFA and DFA (finite automata) of the minimum
NFAtoDFA
- It s a program that convert NFA(Non deterministic Finite Automata) to DFA(Deterministic Finite Automata). This article used in scanners and parsers to detect some pattern of input characters similar to tokens.
NFAtoDFA
- 确定化NFA转换为DFA,自动机课程设计实例，txt格式源码-The Determination of NFA converted to DFA, automata course design examples txt format source
NFAtoDFA
- 将NFA转成DFA的程序，将不确定的自动机转化为确定的自动机，用于编译原理的研究。(Transforming NFA into DFA program, transforming uncertain automata into definite automata, is used for compiler principle research.)