搜索资源列表
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 without regret that I paid the
DFA
- DFA的一个例子，有点意思，希望对大家有所帮助，
dfa
- 由输入的正规式自动生成NFA，再转换为DFA。再对指定的文件进行处理。找出该文件中与正规式匹配的子串。
NFA转换成DFA
- C++实现NFA转换成DFA
NFA-DFA.rar
- 实现从nfa到dfa的转换，并且输出中间的状态集以及转换表,From nfa to dfa conversion and output as well as the middle of the state set conversion table
NFA-CONVERT-TO-DFA
- 编写程序读取nfa.txt，构造出NFA的数据结构，并编写算法实现NFA到DFA的转化。-Write a program to read nfa.txt, the data structure constructed NFA and NFA to DFA write algorithm transformation
DFA.rar
- 扫描样本字符串，转换成NFA，继续转换，成为DFA，验证此字符串。,Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
NFA-DFA
- 词法分析器 NFA DFA 最小化DFA 实验报告-Lexical analyzer NFA DFA
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
bianyiyuanli
- 一. 实验目的： 设计、编写和调试一个具体的词法分析程序，加深对词法分析理论和自动词法分析工具的理解、实践和掌握。 二. 实验要求： ① 学习和理解正则表达式理论,写出C—语言的记号的完整的正则表达式;(适当使用正则定义) ② 学习和理解有限机理论,根据前面的正则表达式,用基于经验的方法画出C—语言的记的DFA图; ③ 用基于DFA图的算法编写C—语言的词法分析程序; ④ 学习词法分析程序的自动生成工具,使用LEX工具实现C—语言的词法分析程序.- 1. Experimental goal: T
TEMPLATE
- 输入正则表达式，转化为NFA,DFA，从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
NFATODFA
- NFA到DFA的转换 这是用visual C++ 编写的程序 有注释！-NFA to DFA conversion This is to use visual C++ have the Notes prepared by the procedure!
Lexical_analysis
- 智能的词法分析 ，能任意输入正则表达式，能求出NFA，DFA，minDFA,和最后的匹配情况-Lexical analysis of intelligence, can enter any regular expression can be obtained NFA, DFA, minDFA, and the final match of the situation
NFA_DFA
- 正规(则)表达式转化为NFA，DFA，DFA最小化，显示结果和过程-Formal (then) regular expressions into NFA, DFA, DFA minimization, and process the result will be displayed
DFA
- 调试了一个简单的DFA程序，可以作为借鉴，比较实用的程序。-Debug a simple DFA procedures, can be used as reference, more practical procedures.
dfa
- Dfa minimization from nfa
TYJ(1)
- 一个简单的DFA,能实现任何自动机的识别器，且可以有多个终态-A simple DFA, to achieve any recognition automata, and can have more than one final state
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
nfa-dfa
- its nfa-dfa converter
DFA
- 简单DFA有穷自动机，可以根据输入的状态转换表，进行状态转换，对输入的字符串判断，该自动机是否可以接受。并有具体报告说明。-Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific