Location:
Search - nfa
Search list
Description: 根据输入的正则式产生NFA,然后转化为DFA,并化简-under the importation of which is generated NFA-and then into DFA and Simplification
Platform: |
Size: 6144 |
Author: conan |
Hits:
Description: 语法分析器lex和词法分析器yacc的C++语言实现
1.Lex
（1）Lex输入文件的解析
（2）正规表达式的解析
（3）一个正规表达式到NFA的转换算法实现
（4）多个NFA的合并
（5）NFA的确定化和最小化算法实现
（6）返回状态与返回内容的对应
2.Yacc
（1）Yacc输入文件的解析
（2）上下文无关文法到对应LR(1)文法的下推自动机的构造
（3）LR(1)文法的下推自动机到相应分析表的构造
（4）LR(1)总控程序的构造（查表程序）
（5）符号表的构建与相应管理程序
（6）语义动作程序的加入
环境:Visual Studio.NET 2003-Parser lex and yacc lexical analyzer C language 1.Lex (1) Lex lose into the analytical document (2) Analysis of the formal expression (3) a formal expression of the NFA conversion algorithm (4 ) more than the combined NFA (5) NFA and the determination of the smallest algorithm (6) to return to state and the return of the contents 2.Yacc counterparts (1) Yacc the analytical input file (2) context-free grammar to the corresponding LR (1) grammar pushdown automata Construction (3) LR (1) grammar pushdown automata corresponding to the tectonic analysis table (4) L R (1) General procedures for the control structure (look-up table) (5) Construction of the symbol table with the corresponding management procedures (6) semantic action procedures to the environment : Visual Studio 2003
Platform: |
Size: 40960 |
Author: 尤冉 |
Hits:
Description: 有限自动机的确定化及化简
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 state CRT ds_temp-- NFA to DFA-- input characters-- must request id Start an incremental
Platform: |
Size: 3072 |
Author: 黄启龙 |
Hits:
Description: 编译原理课程设计详细文档，包含NFA->DFA,DFA的最小化。-compile detailed design documentation, including NFA-
Platform: |
Size: 98304 |
Author: |
Hits:
Description: NFA转化为DFA的一个程序!希望能有点作用!-NFA into a DFA procedures! Hope to some purpose!
Platform: |
Size: 4096 |
Author: eyeknight |
Hits:
Description: k中心点
编制和调试一个程序，它将用户输入的正规式转换为以状态图和矩阵形式表示的确定有穷自动机。
1．把正规式转换为NFA
2．将NFA确定化为DFA
• ＃作为正规式的终止符
• 考虑复合正规式
• 开始状态号为0
-focal point for the preparation of k and debug a program, it will the user to enter the formal conversion to a state diagram and matrix forms express the determination of DFA. 1. The formal type is converted to NFA2. Will determine the NFA into a DFA
Platform: |
Size: 1024 |
Author: 刘自咏 |
Hits:
Description: 识别正规式，将其转化为nfa,然后转化为dfa-Recognition of formal style, be translated into nfa, and then into a DFA
Platform: |
Size: 1661952 |
Author: 刘自咏 |
Hits:
Description: 把非确定有穷状态自动机NFA转换为确定有穷状态自动机DFA！-The non-deterministic finite state automaton NFA is converted to determine the finite state automaton DFA!
Platform: |
Size: 1024 |
Author: 王博 |
Hits:
Description: 对C++进行词法和语法分析。
要求：
词法分析部分写出相应的正规集、正规式、NFA、DFA
写出语法分析所采用的方法和完成的语法分析功能
编写出响应的编译程序
写出完整的课程设计报告
说明：课程设计报告包括的基本内容有：
一、课程设计题目
二、课程设计的目的
三、课程设计的基本内容和实现功能介绍
四、词法分析：包括系统的词法规则，相应的正规集、正规式、NFA、DFA
五、语法分析：包括语法规则，分析所采用的技术和算法-On C++ For lexical and syntax analysis. Requirements: lexical analysis to write the corresponding part of the regular set, formal style, NFA, DFA write parsing methods and the completion of the syntax analysis prepared to respond to the compiler to write a complete report on curriculum design: curriculum design report including the basic contents are as follows: I. Title II curriculum design, curriculum is designed to three, the basic content of the curriculum design and realization of the four features, lexical analysis: including the system of lexical rules, the corresponding regular sets, formal style, NFA, DFA V. syntax analysis: including grammar rules, analysis techniques and algorithms used
Platform: |
Size: 3072 |
Author: 王博 |
Hits:
Description: 输入一个正则表达式（也可以预先将一些测试的正则表达式输入到文件中）
（2）输出相应的NFA图（要求用画图方法完成并要求是逐步逐步进行画，好象书本P47例2.12和2.13一样逐步得到结果）
（3）NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图）
（4）DFA最小化（也要求用画图方法完成）
（5）选做部分：将最小化DFA所对应的识别程序自动产生出来。（将自动产生的识别程序以文件形式保存即可，并可以在系统中查看该文件）
-err
Platform: |
Size: 409600 |
Author: 杨小娜 |
Hits:
Description: 这是一个编译原理中的一个技术，将已有的nfa转换为dfa的程序-This is a Compilation Principle of a technology, the NFA has been converted to DFA procedures
Platform: |
Size: 1024 |
Author: 合合 |
Hits:
Description: 编译课程设计，有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化-Compiler design, finite automata to identify and minimize the completion of the DFA, NFA, RE between the conversion and DFA Minimization
Platform: |
Size: 3577856 |
Author: junjun |
Hits:
Description: 编译原理小作业NFA转DFA，用C写的，环境是VC下的控制台程序-Compiler Construction Principles small operating NFA to DFA, written using C, the environment is under VC console procedures
Platform: |
Size: 8192 |
Author: 徐元浩 |
Hits:
Description: 一个大学时候做的编译原理的实验.实验内容是正则表达式到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 .
Platform: |
Size: 124928 |
Author: THM |
Hits:
Description: 输入一个正则表达式,输出相应的NFA图，NFA转换为DFA，将DFA最小化。-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA, the DFA minimization.
Platform: |
Size: 172032 |
Author: 彪 |
Hits:
Description: 将正规式变成NFA的算法,如(a|b)*(aa|bb)(a|b)*-NFA into a formal style of the algorithms, such as (a | b)* (aa | bb) (a | b)*
Platform: |
Size: 3072 |
Author: 侯坤 |
Hits:
Description: 从正则表达式到NFA的JAVA实现代码，图形界面。
Platform: |
Size: 35840 |
Author: 苏鸿星 |
Hits:
Description: 构造nfa及到DFA的转换 构造nfa及到DFA的转换-NFA to DFA structure and structural conversion to NFA and DFA conversion
Platform: |
Size: 5120 |
Author: 鸿佳 |
Hits:
Description: 这是编译原理的一个实验, 是把一个正则表达式转化为不确定有穷自动机NFA的算法程序,朋兴趣的朋友可以下载来看看哦。
一个正则表达式就是由普通字符（例如字符 a 到 z）以及特殊字符（称为元字符）组成的文字模式。该模式描述在查找文字主体时匹配的一个或多个字符串。正则表达式作为一个模板，将某个字符模式与所搜索的字符串进行匹配。
本实例的符号包括：
1. 基本正则表达式, 如ab
2. 重复, 如a*
3. 在各项中选择, 如a|b
使用时在Convert的Reg Exp中点击输入正则表达式, 然后单击Convert->to NFA就可以了。
Platform: |
Size: 35840 |
Author: 剑侠 |
Hits:
Description: NFA非确定型有穷自动机的相关功能
不用修改，直接可用．-NFA Non-deterministic Finite Automata related functions need not be amended, can be used directly.
Platform: |
Size: 1024 |
Author: 秋峰 |
Hits:
«
1
2
34
5
6
7
8
9
10
...
19
»