搜索资源列表
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)
LR1
- 利用字符二维数组对文法、First集、Follow集、终结符集、非终结符集等数据进行存储，还有一个是状态表存储DFA的状态。二维TAB表对其中的DFA表进行存储，横坐标是状态号，纵坐标为文法中的符号（终结符和非终结符）。-Two-dimensional array of characters to use grammar, First Set, Follow sets, at the end of sets, sets and other non-terminator data storage,
NFA
- 用C#编写的不确定有穷自动机NFA=>确定有穷自动机DFA的转换算法，-Uncertainty with C#, finite automata NFA => OK finite automaton DFA conversion algorithm
[NFA+TO+DFA]
- [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
NFA_DFA
- 利用C++语言实现编译词法分析中的NFA到DFA的转换。-Language implementation using C++ compiler lexical analysis of the NFA to DFA conversion.
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
thedesignofanalyzing
- 主要介绍了词法分析器的lex实现以及DFA和NFA构造状态表的方法-Mainly introduce the lexical analyzer lex implementation, as well as DFA and NFA state table structure of the Ways
converter
- nfa to dfa convertor u can anything to do from this
dfa
- 程序根据用户输入的dfa或者文件中的dfa，能最小化dfa，并根据最小化dfa来测试字符串-Program based on user input or file in dfa dfa, minimizes dfa, and according to the test string minimizing dfa
DFA
- 输入正则表达式转化为DFA，最小ＤＦＡ部分还不完善-Enter the regular expression into a DFA, minimal DFA part is not perfect
NFA-to-DFA
- NFA到DFA的转换，老师布置的作业，千辛万苦，拿出来和大家分享下-NFA to DFA conversion, the teacher assigned homework, go through untold hardships, out and share
NFA-TO-DFA
- 本文件实现的是词法分析器 使用了JAVA语言来发 希望对大家有所帮助-NFA to dfa
nfa-dfa
- 状态机nfa to dfa-The state machine nfa to dfa ...................................
DFA
- 编写的一个C语言程序，模拟实现DFA识别字符串的过程-The process of writing a C language program to simulate the realization DFA identification string
DFA
- 形式语言与自动机中DFA(确定的有限自动机)的java实现-Formal Languages and Automata (DFA) to achieve the java
Sensitive
- 用Java实现，DFA过滤敏感词，包含源代码和词库(Using Java to implement DFA filtering sensitive words)
新建文件夹
- DFA->NFA->MFA 并依次输出数据表(DFA->NFA->MFA And output the data table in turn)
Complier
- DFA 编译原理代码 c++ windows(DFA Compiler code c++ windows)