Search - regular expression to nfa

Search - regular expression to nfa - List

[ELanguage] Regular DL : 0: 输入一个正则表达式，可以使用：小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集然后程序将生成相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end; * Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
Date : 2008-10-13 Size : 171.39kb User : 杨震原
[ELanguage] Regular DL : 0: 输入一个正则表达式，可以使用：小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集然后程序将生成相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
Date : 2025-12-29 Size : 244kb User : 杨震原
[ELanguage] my-nfa DL : 0: 这是我自己写的将正则表达式的parser，通过将正则表达式先编译成ＮＦＡ格式，大大加快搜索速度．-This is what I wrote it myself will be the regular expression parser, by first compiling regular expressions into NFA format, greatly accelerate the search speed.
Date : 2025-12-29 Size : 2kb User : binch
[ELanguage] AutoMake5.0 DL : 0: 一个大学时候做的编译原理的实验.实验内容是正则表达式到NFA到DFA到最小化DFA最终生成词法分析代码的整个过程的演示.那时由于时间关系,词法分析代码自动生成部分还没完成.-When a university to do the compiling principle experiment. Experiment is a regular expression to NFA to DFA to minimal DFA of the final lexical analysis code to generate the whole process of demonstration. At that time, due to time constraints, lexical analysis part of automatically generated code not yet complete .
Date : 2025-12-29 Size : 122kb User : THM
[ELanguage] regtonfatodfa DL : 0: Date : 2025-12-29 Size : 286kb User : 孟飞
[ELanguage] TEMPLATE DL : 0: 输入正则表达式，转化为NFA,DFA，从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
Date : 2025-12-29 Size : 66kb User :
[ELanguage] DFA DL : 0: 输入一个正则表达式，输出相应的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)
Date : 2025-12-29 Size : 14kb User : liyingan
[ELanguage] lex DL : 0: 用c++实现的此法分析器,包括正则表达式解析,正则到NFA转换,NFA到DFA转换,和最终的匹配,详见包中README文件-Using c++ parser to achieve this method, including regular expression analysis, while the NFA is converted, NFA to DFA conversion, and end the match, see the package README file
Date : 2025-12-29 Size : 16kb User : 0x7c00
[ELanguage] Automate DL : 0: graphic Automaton simulator,NFA to DFA conversion and minimisation
Date : 2025-12-29 Size : 676kb User : darkzan
[ELanguage] Regularexpressionenfa DL : 0: Regular expression to e-nfa
Date : 2025-12-29 Size : 1kb User : Mani
[ELanguage] LexicalAnalyzer DL : 0: 手工构造一个能够识别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.
Date : 2025-12-29 Size : 330kb User : 罗丹
[ELanguage] nfa.c DL : 0: This program is used to covert regular expression into NFA in compiler design.
Date : 2025-12-29 Size : 1kb User : Abhishek
[ELanguage] nfa DL : 0: NFA algorithm to show the nfa of a given regular expression
Date : 2025-12-29 Size : 1kb User : nancy
[ELanguage] bianyisrc DL : 0: 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
Date : 2025-12-29 Size : 18kb User : dai
[ELanguage] cifafenxi DL : 0: 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.
Date : 2025-12-29 Size : 6kb User : 晓
[ELanguage] lexer DL : 0: 词法分析器，输入正规式，转换成NFA，在到DFA，最小化DFA。用java编写了可视化界面，健壮性强-允许输入拉丁字符的拼音 Lexical analyzer, enter the regular expression, convert the NFA to DFA, minimize DFA. Java prepared a visual interface, robustness
Date : 2025-12-29 Size : 473kb User : yang
[ELanguage] RextoNFA DL : 0: 实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
Date : 2025-12-29 Size : 187kb User : wu
[ELanguage] B6MHjIFh DL : 0: 编译原理实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
Date : 2025-12-29 Size : 56kb User : wu