Location:
Search - nfa
Search list
Description: 正则表达式及nfa到dfa再到mfa的转化-Regular expressions and nfa to dfa conversion and then to mfa
Platform: |
Size: 8192 |
Author: 李睿 |
Hits:
Description: 一个实验, 是把一个正则表达式转化为不确定有穷自动机NFA的算法程序,朋兴趣的朋友可以下载来看看哦。 一个正则表达式就是由普通字符（例如字符 a 到 z）以及特殊字符（称为元字符）组成的文字模式。该模式描述在查找文字主体时匹配的一个或多个字符串-An experiment is to a regular expression into NFA uncertain finite automaton algorithm program, friends of friends interested can download see Kane. A regular expression is the general character (such as characters a to z) and special characters (called metacharacters) composed of text mode. This model describes the main text in the search when one or more of the string match
Platform: |
Size: 351232 |
Author: yang |
Hits:
Description: nfa 转化为 dfa 能够运行成功，我自己已经实验过了，欢迎下载-nfa dfa able to run into a success, I have experimented with, and welcome to download
Platform: |
Size: 2048 |
Author: 小杰 |
Hits:
Description: 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。
将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually construct a C language to identify all the typical words such as: identifiers, numbers, operators, and if, while the determination of reserved words such as finite automata, and write on the procedure should be automatic machine then a simplified C language program for the input file, through the design of automata based on the lexical analysis procedure for obtaining the input file and within each code word table, and save the results to file the form (that is, TOKEN sequence). Defining themselves in all the regular expression into NFA, and then consolidated for the NFA ' , then NFA' into a DFA, DFA then converted to a minimum state DFA ' , the last by the DFA' into a lexical analysis program.
Platform: |
Size: 337920 |
Author: 罗丹 |
Hits:
Description: **本次实验在Visual Studio.NET 2003环境下开发**
此压缩包内包括以下五个文件：
1.Lex的源代码文件 Lex.cpp
2.Lex的测试输入文件 test.txt
3.测试文件需包含的头文件 yytab.h
4.经过Lex生成的结果文件yylex.cpp
5.说明
关于Lex:
本实验中完成的Lex可以完成以下算法：
1.输入文件解析
2.多个NFA合并
3.NFA转换DFA
4.最小化DFA
5.生成代码
关于输入文件格式：
此Lex的缺点是对输入文件的错误识别能力较弱，并且如不按照格式要求书写输入文件，可能会使程序
报错。这个缺点，我们会尽快改正。
此Lex所使用的特殊符号：
[]{}()|*
其中若在需要识别的串中使用[]()|*，则在前面加上\即可，例如：需要识别||,[,则写成\|\|,\[即可。-Visual Studio.NET 2003
source :lex.cpp
Platform: |
Size: 652288 |
Author: 王伟 |
Hits:
Description: 编译原理，自动分析语法，判断与法是否符合语法分析规则-nfa
Platform: |
Size: 1024 |
Author: 王一 |
Hits:
Description: .定义一个圆类，具有成员函数能分别计算圆的周长、面积，要求采用构造函数初始化圆对象，且在释放圆对象时能输出“The circle is free!”信息。
-DFA-NFA
Platform: |
Size: 885760 |
Author: jiangzhili |
Hits:
Description: 不确定的有穷自动机NFA转确定化的有穷自动机DFA
Platform: |
Size: 86016 |
Author: lk |
Hits:
Description: NFA到DFA转化C代码
大家可以参考参考-NFA to DFA transformation of C code you can refer to the reference Ha ha ha ha ha
Platform: |
Size: 15360 |
Author: maojianyu |
Hits:
Description: 编译原理所有重要算法的实现 以及词法分析语法分析、中间代吗生成。LL1 LR0 算符优先 算符表达式到NFA再到DFA的算法。-Compile program. LL1 LRO NFA->DFA->MFA
Platform: |
Size: 119808 |
Author: lee |
Hits:
Description: Converting a regular expression to a NFA
Platform: |
Size: 15360 |
Author: tremor |
Hits:
Description: 实现了正则表达式转NFA，NFA转DFA，DFA最简化的过程。并可输出DFA到图像。-It can translate Regular Expression into NFA, NFA into DFA, and minimize the DFA. The result can be printed as a graph.
Platform: |
Size: 187392 |
Author: sunli |
Hits:
Description: 简单的小程序，用于开发Java编译器！若有错误，请给予指正-the nfa to dfa is simple,but I think is ok now!I hope some one can catch the error for me!
Platform: |
Size: 3072 |
Author: 莫属 |
Hits:
Description: Program to take Nfa as input and a string as input.Check whether string is accepted by NFA or not
Platform: |
Size: 3072 |
Author: juhimodi |
Hits:
Description: 给出一个NFA，用代码实现到DFA的转换，编译原理-Give an NFA, with the code to DFA conversion, compiler theory
Platform: |
Size: 3072 |
Author: 祝海兰 |
Hits:
Description: 给出一个正则表达式，设计一个程序，让其实现到NFA的转换-A regular expression is given, design a program that allowed the conversion to achieve to the NFA
Platform: |
Size: 419840 |
Author: 祝海兰 |
Hits:
Description: 1.自动机以状态转换矩阵的方式在计算机内部进行表示；2.根据NFA确定化的方法，将NFA确定化；3.判断自动机是否以最小化，若不是将其最小化；4.以状态转换矩阵的方法表示出确定化、最小化后的自动机。-1. Automatic machine to the way state transition matrix be represented inside the computer 2. According to the method of determining NFA, the NFA Deterministic 3. To determine whether the automatic machine to minimize, if not minimize it 4. To state transition matrix method to determine of the show, minimized automaton.
Platform: |
Size: 7168 |
Author: feihu |
Hits:
Description: 形式语言 中的正规式处理及自动机的转换 程序简单 易于理解-The form of a formal language-processing and automatic machine conversion process is simple and easy to understand
Platform: |
Size: 3380224 |
Author: array |
Hits:
Description: 基于Mac OS下的VIsual C++编程
实现词法分析器作用-Visal C++ Language to realize the functioon of DFA & NFA based on the os of MAC OS
Platform: |
Size: 152576 |
Author: Stoudemire |
Hits:
Description: dfa to nfa conversion of automatons in pascal:
Determinization+minimalization
Platform: |
Size: 3072 |
Author: Robert Stoynov |
Hits: