e i fjfianidfn ldsif ldno lviv livdf

简单的词法分析小例子- Simple lexical analysis small example

用C#做的《编译原理》的PROJECT--语法分析器（算符优先法） 文法，句子均支持从TXT文件输入或者手工键入，分析结果可保存为RTF文件-With C# To do the

编译原理的课程设计，if-else条件语句的翻译，包括语法分析和词法分析。-compiler theory of curriculum design, if-else statements for the translation, grammatical analysis and lexical analysis.

智能的词法分析 ，能任意输入正则表达式，能求出NFA，DFA，minDFA,和最后的匹配情况-Lexical analysis of intelligence, can enter any regular expression can be obtained NFA, DFA, minDFA, and the final match of the situation

编译原理的VC实现,最近做编译作业,下载的.-compile VC tenets of a recent compiler operations, the downloaded.

简单的c词法分析器，能分析出整数，标志符，保留字等。-easy wordedit

这个是我编译原理课程设计的 内容，呵呵 我遍的是词法分析，基本的功能都能够实现，如词法分析，词法查错，删除无实质意义的字符等，不懂编译的就不用看了，编译真的很难！！！不过好象没什么用-this my compiler theory of curriculum design, Oh my times of lexical analysis, the basic functions are to achieve, such as lexical analysis, lexical troubleshoot, remove no real significance of the characters, do not know the compiler would not have to read, compile it really hard! ! ! But it seems usele

求正规表达式到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.

1、输入串应是词法分析的输出二元式序列，即某算术表达式“实验项目一”的输出结果。输出为输入串是否为该文法定义的算术表达式的判断结果。 2、LL(1)分析过程应能发现输入串出错。 3、设计两个测试用例（尽可能完备，正确和出错），并给出测试结果。 -1, input strings should be the output of lexical analysis of binary sequence, that is, the arithmetic expression of a

C编译器源码是我到处找来的,看了之后很有收获-C compiler source is found everywhere, and found the great harvest