Location:
Search - RE NFA
Search list
Description: 编译课程设计，有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化
Platform: |
Size: 213949 |
Author: junjun |
Hits:
Description: 编译课程设计，有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化-Compiler design, finite automata to identify and minimize the completion of the DFA, NFA, RE between the conversion and DFA Minimization
Platform: |
Size: 3577856 |
Author: junjun |
Hits:
Description: 正则表达式转换为有穷自动机的算法，用c语言编写的。-Regular expression is converted to DFA algorithm, using c language.
Platform: |
Size: 279552 |
Author: Y.A.M |
Hits:
Description: 由输入的正规式自动生成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 style of substring matching.
Platform: |
Size: 6144 |
Author: 夏天 |
Hits:
Description: 输入一个正则表达式，输出相应的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 methods and called for the first table structure generated by a subset of re-painting DFA graph), DFA minimization (also requires drawing method)
Platform: |
Size: 14336 |
Author: liyingan |
Hits:
Description: 词法分析器
re->nfa->d fa优化-Lexical analyzer re-> nfa-> dfa-> dfa Optimization
Platform: |
Size: 3072 |
Author: 周子神 |
Hits:
Description: 实现从nfa到dfa的转换，并且输出中间的状态集以及转换表-From nfa to dfa conversion and output as well as the middle of the state set conversion table
Platform: |
Size: 3072 |
Author: tang |
Hits:
Description: performs re to nfa conversion
Platform: |
Size: 1024 |
Author: icefiremoi |
Hits:
Description: 正则表达式到DFA
并能够输出检测结果。输入文件要求：
（a|b）* 文件第一行
aaaa 文件第二行
a-Re to DFA
Platform: |
Size: 4096 |
Author: Superman |
Hits:
Description: 这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，此程序最终完成的是下面网站要求的功能。http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm-这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm
Platform: |
Size: 16384 |
Author: lixmin |
Hits:
Description: This Program will convert the Non-Deterministic Finite Automata to Deterministic Finite Automata.
Here RE is not given but NFA-Table should be given to the Input And output will FA-Table.
So best of luck-This Program will convert the Non-Deterministic Finite Automata to Deterministic Finite Automata.
Here RE is not given but NFA-Table should be given to the Input And output will FA-Table.
So best of luck..........
Platform: |
Size: 16384 |
Author: Sandy Patel |
Hits:
Description: 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular grammar G, write a regular expression RE 3, according to the regular expression RE, draw the NFA 4, the NFA into a DFA 5, the DFA conversion the mininum state DFA 6, mininum state DFA is the lexical analysis process flow chart, flow chart according to the preparation of the corresponding lexical analyzer.
Platform: |
Size: 6144 |
Author: 晓 |
Hits:
Description: java files for automate re to nfa
Platform: |
Size: 1024 |
Author: wwww |
Hits:
Description: 这是Thompson将正规式转为NFA的详细算法-Thompson Re to NFA
Platform: |
Size: 2149376 |
Author: 波江 |
Hits: