语法分析

语法分析―在词法分析的基础上分析表达式-syntax analysis-in lexical analysis on the basis of analysis of expression

词法分析程序。用于词法分析器的制作与应用。-lexical analysis procedure. Lexical analyzer for the production and application.

读取BNF表达式和终结符文件，然后生成相应文法的First、Follow集、文法分析表以及冲突表。-BNF expressions and terminator read the file, and then generates the appropriate grammar First, Follow sets, grammar analysis table, as well as conflict table

PASCAL语言子集编译器，足够计算机系的学生交作业用了-PASCAL language subset compiler, the enough computer department s students handed over the work to use

JavaStruts 中文文档. 这是一本很好的struts的中文帮助文档， 在网上很难找到。-JavaStruts Chinese documents. This is a very good struts help the Chinese documents, the Internet is hard to find.

词法分析的程序设计- Lexical analysis programming

ECSHOP module for themes

编译原理课程设计，输入布尔表达式，然后有系统自动转换为逆波兰四元式-compiler theory of curriculum design, the importation of Boolean expressions, and then the system automatically converted to reverse Poland four yuan-

表达式的计算程序- Expression computational procedure

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