搜索资源列表
编译原理及实践
- 目 录 译者序 前言 第1章 概论 1 1.1 为什么要用编译器 2 1.2 与编译器相关的程序 3 1.3 翻译步骤 5 1.4 编译器中的主要数据结构 8 1.5 编译器结构中的其他问题 10 1.6 &
有限自动机的确定化
- 有限自动机的确定华,NFA到DFA的转变。-Ascertain of finite auto-machine , from NFA to DFA.
REManageAndNFAToDFA
- 能够完成正规式到NFA的转换,NFA到DFA的转换(子集法),DFA的最小化,测试一个生成串是否能为生成的DFA所识别-to complete the formal ceremony to change the NFA, NFA conversion to DFA (subset), the smallest of DFA, testing whether a string of generation to generation by the DFA Recognition
zidongji
- 编译原理中的NFA转换到DFA(自动机的转换)-compiler principles of the NFA conversion to DFA (automatic machine translation)
youxianzidongjihuajian
- 有限自动机的确定化及化简 1、更正了 DFA_simplify2 中的错误 2、增加新旧状态对照表 ds_temp --NFA转DFA -- 输入字符 -- 要求 id 必须从 1 开始连续递增-Finite Automata and the identification of a simplification, correction of the errors DFA_simplify2 2, increase the old and new stat
COMPILEPAPER
- 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。-compile detailed design documentation, including NFA -
NFAtoDFA
- NFA转化为DFA的一个程序!希望能有点作用!-NFA into a DFA procedures! Hope to some purpose!
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
- 不确定的有穷自动机转化为确定的有穷自动机的转换算法及实现-Uncertain finite automaton into a deterministic finite automaton conversion algorithm and implementation
nfa
- java语言编程,编译原理中NFA转DFA程序。-java programming language, compiler theory NFA to DFA program.
DFA
- NFA化为DFA,并将DFA最小化,输出最小化后的DFA的状态转化矩阵。-NFA into a DFA, and minimize DFA, DFA minimize output condition after transformation matrix.
cciss_ioctl
- Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags. -Executes a regular expression NFA DFA over a range using a variant of the paralle
DFA-NFA
- 使用VC++实现了DFA和NFA的大部分功能,希望有需要的拿去-Use VC++ implements most of the functionality of DFA and NFA, hope there is a need take
DFA--TO--NFA--simpleDFA
- 程序实现的是编译原理中的NFA到DFA的转换(使用子集构造法)。以及使用等价划分算法实现的DFA的简化-Realize the principle is to compile the NFA to DFA conversion (using the subset construction). As well as simplify the use of equivalence partitioning algorithm to achieve the DFA
NFA-to-DFA-Conversion
- 分享一个NFA到对应的DFA的转换程序-Program to convert a given NFA to the corresponding DFA
2
- 实现NFA到DFA的转化,方便初学者使用体会(this is easy to understand)
新建文件夹
- DFA->NFA->MFA 并依次输出数据表(DFA->NFA->MFA And output the data table in turn)
NFAtoDFA
- 将NFA转成DFA的程序,将不确定的自动机转化为确定的自动机,用于编译原理的研究。(Transforming NFA into DFA program, transforming uncertain automata into definite automata, is used for compiler principle research.)