TINYC source code

另一版本的词法分析器- Another edition morphology analyzer

实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA 　N一定存在一个DFA　Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .

这是简单的单词统计程序，大家多多指教- This is the simple word statistics procedure, everybody many advises

简单的使用mfc开发的程序。- Simple use mfc develops procedure.

求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.

自己用纯C语言做的词法编译器，可能大家作业能用的上吧，-A semantics compiler in c programed by myself,maybe you can use it foe you homework

编译原理实验一源文件的输入输出、 二词法分析-Principle Experiment 1 source file to compile the input and output, two lexical analysis

这是一个语法分析器-This is a parser

反编译专家，很好用的。支持右键，支持文件夹反编译-Decompile expert, well used. Support the right to support decompile folder