编译原理课程设计，输入布尔表达式，然后有系统自动转换为逆波兰四元式...

模拟串口通信代码M88 模拟串口通信代码M-Simulation of serial communication serial port communication code M88 simulation code M

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

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

词法分析 从字符串表示的源程序中识别单词符号-Lexical analysis of source code from a string that identify word symbols

对pl0语言程序的语法分析源程序，由flex和bison生成。带实验报告。- To the pl0 language procedure grammar analysis source program, produces by flex and bison. Belt test report.

编译原理词法，语法分析，能检查错误，pl/0,-Compilation Principle lexical, grammatical analysis, to check for errors, pl/0,

读取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

C#语言编译器和库文件源码-C# Language compiler and library file source

小而快的c编译器，可以直接解释运行C语言写就的源程序。-Small but fast c compiler can directly explain the C language to run on the source.

这个是对上次S语言词法分析的修改,程序已修改好了.-this is the last S language lexical analysis of the changes, the procedure has been revised up.