Location:
Search - nfa
Search list
Description: This program is used to covert regular expression into NFA in compiler design.
Platform: |
Size: 1024 |
Author: Abhishek |
Hits:
Description: NFA algorithm to show the nfa of a given regular expression
Platform: |
Size: 1024 |
Author: nancy |
Hits:
Description: 编译原理 NFA 确定化
使用set
有注释，感觉已经很多了-Compiler theory of NFA to determine
Platform: |
Size: 2048 |
Author: 陈图嘉 |
Hits:
Description: 编译原理课程实验，NFA到DFA转换及化简的C++语言实现。-Compiler theory course experiment, NFA to DFA Conversion and Reduction of C++ language.
Platform: |
Size: 11264 |
Author: shirley |
Hits:
Description: DFA NFA 文件生成转换 C++ 制作源码-DFA NFA file to generate source code conversion C++ production
Platform: |
Size: 2048 |
Author: cyl |
Hits:
Description: 词法分析器 NFA DFA 最小化DFA 实验报告-Lexical analyzer NFA DFA
Platform: |
Size: 46080 |
Author: huang |
Hits:
Description: 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
Platform: |
Size: 18432 |
Author: dai |
Hits:
Description: 内容：自动机编程，NFA转换DFA程序，将输入的NFA转换为DFA-Content: automatic machine programming, NFA DFA conversion procedure to convert the input of the NFA to DFA
Platform: |
Size: 46080 |
Author: tong |
Hits:
Description: 正则表达式转化为NFA，NFA转化为DFA，DFA最小化-regular expression toDFA
Platform: |
Size: 183296 |
Author: 孙林晶 |
Hits:
Description: nfa to dfa concersion code with regular expression
Platform: |
Size: 7168 |
Author: sourav |
Hits:
Description: 把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。
-NFA into a DFA to determine the algorithm to achieve a given NFA M, to determine into a DFA M ' , then the DFA M state minimization, given DFA M of finite state set S is divided into several disjoint subset, such that: any two different subset of the state are distinguishable, and the same subset of any two states are equivalent (to take advantage of Ia function, but does not need to construct ε-CLOSURE function, because This is a DFA). Output of the simplified DFA M ' .
Platform: |
Size: 2048 |
Author: 王静晓 |
Hits:
Description: 编译原理实验 NFA识别语言的java实现，为NFA.java文件中的NFA类实现成员函数boolean recognizeString(int move[][][], int accept_state[], String word).-Principle experiment NFA compile the java language to achieve recognition for NFA.java file NFA class implements member functions boolean recognizeString (int move [][][], int accept_state [], String word).
Platform: |
Size: 4096 |
Author: 陈竑睿 |
Hits:
Description: Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2-Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2
Platform: |
Size: 1024 |
Author: Merwyn |
Hits:
Description: 编译原理实验 将nfa到dfa编程实现可在vc 6.0中运行-Principle experiment is compiled nfa dfa programming to run in vc 6.0
Platform: |
Size: 2048 |
Author: ANGELO |
Hits:
Description: 我只做到了转化成NFA的阶段~希望可以给大家一些帮助~-I only did the stage into the NFA ~ hope can give us some help ~
Platform: |
Size: 1192960 |
Author: 陈予诚 |
Hits:
Description: 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
Platform: |
Size: 84992 |
Author: 若若 |
Hits:
Description: 输入字符串，首先输出NFA，然后将会输出对应的DFA，最后输出简化的DFA-you can input a string,and then,the program will output NFA DFA and simplest DFA
Platform: |
Size: 4096 |
Author: lanxu |
Hits:
Description: 这是正则表达式到NFA的转换源代码，自己编写的，希望有点用-This is a positive expression to NFA conversion source code I have written, I hope a little bit with
Platform: |
Size: 2048 |
Author: evanw1991 |
Hits:
Description: 为NFA.java文件中的NFA类实现成员函数boolean recognizeString(in mov[][],int accept_state[],Strin word)-For the NFA in NFA.java file class member function boolean recognizeString (in mov [] [], int accept_state [], Strin word)
Platform: |
Size: 4096 |
Author: Cherry |
Hits:
Description: 确定化NFA转化为DFA，这个c++代码用于将NFA转化为DFA ,可以编译通过-The Determination of NFA into DFA
Platform: |
Size: 2048 |
Author: 赵荣 |
Hits:
«
1
2
3
4
5
6
78
9
10
11
12
...
19
»