Description: Given formal type r1, r2, known to the NFA that they were M1, M2 (the state transition matrix and the initial state, final state information were kept in the designated file). Construction of a procedure, the resulting program structure formal ceremony r1r2 (connected computing) of the NFA (its state transition matrix and the initial state, final state information saved in the specified file).
To Search:
- [1)] - On C++ For lexical and syntax analysis.
- [2285] - Compilation Principle: Structure LR (0)
- [nfa] - to NFA
File list (Check if you may need any files):
connect.cpp
nfa.txt
nfa1.txt
nfa2.txt
编译原理课程设计.doc
Download