搜索资源列表
正则式输出DFA
- 输入正则式 输出DFA
NFA到DFA
- 编译原理NFA到DFA的转换源码-compiler theory NFA to the DFA source conversion
DFA
- DFA,这个一个关于确定有限自动机的算法,有兴趣可以参考一下.-DFA, a set of finite automata algorithms are interested can take a look.
DFA自动版
- 我的编译原理大作业，自动分析语法，判断语句是否符合规则。DFA即有穷自动机。因为这个工作量比较大，所以恕我不无帐号发放了。-I build large operating principle, automatic syntax analysis, judgment statement with the rules. DFA that the DFA. Because the workload is bigger, it is not w
用Java语言实现NFA到DFA的等价变换
- 本程序为编译原理里的一个重要的知识点，实现NFA到DFA的转换-procedures for the compiler's a principle important knowledge points, for the NFA to DFA conversion
DFA
- 编译原理试验，dfa简单编译器，以定义好正则式（a|b）*ab,输入字符串，可以判断是否可以接受。-Compilation Principle Test, dfa simple compiler to define a good regular-type (a | b)* ab, input string, you can determine whether to be acceptable.
DFA
- 确定型有限状态机的实现：把DFA的五元组存在文本文件中，输入一个字符串可以判断能否被该机器所接受-Determine the type of the realization of finite state machine: the DFA Five-Tuple of the existence of a text file, type a string can be judged can be accepted by the machi
DFA
- 正则表达式到有穷自动机。 “DFAScan”的改进版本。 编译原理实验代码之一。-Regular Expressions to DFA. DFAScan Improved version. Principle experiment, one of the compiler code.
DFA
- DFA确定型有穷自动机的相关功能 不用修改直接可用-DFA identified DFA correlation function need not be amended directly available
DFA
- DFA的一个例子，有点意思，希望对大家有所帮助，-An example of DFA, a bit mean, and they hope to be helpful to everyone,
DFA
- 正则式转化有穷自动机-Regular type conversion DFA
dfa
- 由输入的正规式自动生成NFA，再转换为DFA。再对指定的文件进行处理。找出该文件中与正规式匹配的子串。-By the importation of automatic generation of formal NFA, and then converted to DFA. Re-designated the documents for processing. To find the document with the informal
DFA
- 输入正规式, 画出对应的NFD, DFA, -Enter the formal ceremony, draw the corresponding NFD, DFA,
DFA
- 编译原理初学者适用，DFA，有穷自动机的功能实现-Compile the application of the principle of beginners, DFA, DFA realize the function of
[NFA+TO+DFA]
- [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
DFA
- 扫描样本字符串，转换成NFA，继续转换，成为DFA，验证此字符串。-Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
DFA
- 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成） -Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing met
DFA
- 计算理论是很抽象的，这里的DFA的实现的源代码，可以明白原理-Computational theory is very abstract, and here the realization of DFA
NFA-DFA
- 实现从nfa到dfa的转换，并且输出中间的状态集以及转换表-From nfa to dfa conversion and output as well as the middle of the state set conversion table
nfa-dfa
- 可实现，nfa到dfa的转化，利用c语言编写，本人以用过一次，老师评价很好-Can be achieved, nfa to dfa conversion using c language, I used once, very good teacher evaluation