搜索资源列表
DFA.rar
- 扫描样本字符串,转换成NFA,继续转换,成为DFA,验证此字符串。,Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
DFA
- 编译原理实验 DFA识别语言的java实现,为DFA.java文件中的DFA类实现成员函数boolean recognizeString(int move[][], int accept_state[], String word).-Compile the DFA recognizes the language of principle experiment java implementation for DFA.java file DFA class implements member fun
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 methods and called for the first
LR0
- (1)构造文法G的LR(0)项目 (2)构造文法G的LR(0)项目集规范族及识别活前缀的DFA (3)证明文法G不是LR(0)文法而是SLR(1)文法,并构造SLR(1)分析表 (4)设计LR语法分析程序,且能输出分析过程 (5)列举两个例子测试语法分析程序(识别失败一例,识别成功一例,后者推导步骤不得少于10步) -(1) construct grammar G of the LR (0) item (2) construct grammar G of the LR (0)
bianyisrc
- 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过,都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
NFA-DFA-MFA
- 正则表达式及NFA-DFA-MFA的转换和判别-Regular expressions and NFA-DFA-MFA conversion and discriminant
FA
- 正则表达式->NFA/DFA/最简表达式-Regular Expression-> NFA/DFA/the most simple expression
java-scanner
- 用C语言(或 C++ )作为宿主语言完成: Java语言词法分析器的设计和实现 其中具体要求: 1. 使用DFA实现词法分析器的设计; 2. 实现对Java源程序中注释的过滤; 3. 利用两对半缓冲区从文件中逐一读取单词; 4. 词法分析结果属性字流存放在独立文件(文件名:scanner_output)中; 5. 统计源程序每行单词的个数和整个源文件单词个数; 6. 具有报告词法错误和出错位置(源程序行号和该行字符)的功能; -Using C language
805NFA
- [用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 equivale
Automate
- graphic Automaton simulator,NFA to DFA conversion and minimisation
NFA_to_DFA211465612008
- this program convert the nfa into dfa
nfatodfa
- other tool nfa convert to dfa by java language
Compilers
- Here you can draw states and linkers to creat a NFA or DFA.
Convert_NFA_TO_DFA
- Converting nfa to dfa in java
DeterministicFiniteAutomata_JAVA
- This program is used in a language examination of the DFA. DFA is one type of FA where there is only one alternative state transitions from one state to another using the same input. In this program users can create a new DFA and DFA can be done in
JDFAReadeera
- 一个java编写的DFA(difinite automata reaader)拥有完备的图形界面和rebustness另付.dat的测试文件 -Write a java DFA (difinite automata reaader) has a complete graphical interface and rebustness extra dat the test file
NFA-TO-DFA
- 本文件实现的是词法分析器 使用了JAVA语言来发 希望对大家有所帮助-NFA to dfa
Java-Scanner
- Java语言词法分析器的设计和实现 其中具体要求: 使用DFA实现词法分析器的设计; 实现对Java源程序中注释的过滤; 利用两对半缓冲区从文件中逐一读取单词; 词法分析结果属性字流存放在独立文件(文件名:scanner_output)中; 统计源程序每行单词的个数和整个源文件单词个数; 具有报告词法错误和出错位置(源程序行号和该行字符)的功能;-Java language lexical analyzer design and implementation of w
DFA
- 形式语言与自动机中DFA(确定的有限自动机)的java实现-Formal Languages and Automata (DFA) to achieve the java