词法分析程序，可对以下的C源程序进行分析

编译原理课程的试验中的语法分析部分，程序比较长，附带报告-compiler theory courses in grammar test analysis, long procedures, fringe report

比较简单的一个词法分析器，帮助学编译原理的初学者理解，可作为教学用途-relatively simple one lexical analyzer to help the school build understanding of the principle of beginners can use as a teaching

这可是我的倾情制作，离卖弄的语法分析器，是自己写的实现程序，不使用他人的结果，直接从原始语法里进行推理计算的，而且这个使用c语言实现的，很多底层函数都是自己来写，像hash表里的hash函数，还有像动态自增长分配等。当然这个还很不完善，但是已经作了很多工作，差就差在没有找到理想的脚本支持语言，最后没有办法只能用函数指针的数组来进行语义调用了。-this but my DEDECATES production, from the play of parser, written in their own procedures, not to use the results of others directly from the original grammar conducted calculated reasoning, but the use of the c language, many are bottom of their function to write, like hash exterior of the hash function , as from the dynamic growth of distribution. Of course, this is far from perfect, but has made a lot of work, they just lacked the poor fail to find an ideal script language support, no way to the final only with an array of function pointers for the Semantic call.

c实现的四元式，模拟编译原理来实现，程序本身没什么难度，不过写这种程序能进一步加深对编译原理的理解！-c 4 yuan to achieve the style, analog compiler principles to achieve, the process itself little more difficult, but to write such a procedure would further deepen the understanding of compiler theory!

这是一个关于词法语法分析器的软件，我们的课程设计的，-This is one of the syntax analyzer software, the curriculum design,

对pl0语言的词法分析程序，带分析工具flex。输入一个PL0源程序文件名，即可看到词法统计结果。- To the pl0 language lexical analyaer, brings analysis tool flex. Inputs a PL0 source program filename, namely as worthy of looking at as morphology statistics result.

编译原理的语法生成器 ，可以对C语言程序进行分析。-principle of grammar compiler generator, the C language program for analysis.

简单的Java Gui,用Java编辑器真接打开- Simple Java Gui, really meets with the Java editor opens

实现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. .

词法分析器实现简单的词法分析词法分析 器实现简单的词法分析-Realize a simple lexical analyzer Lexical analyzer Lexical Analysis realize a simple lexical analysis