编译器 用C语言对下述文法和单词表定义的语言设计编制一个编译器...

reads a set of C-source files and generates a two-column listing of those sources-reads a set of C-source files and generates a two-column listing of those sources

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

用C开发的C语言编译器，实现了词义、语义、语法检查和分析-C development of the C language compiler and realized the meaning, semantics, syntax check and analysis

语法分析 C++ 原创 -Parsing C++ Original Ha Ha Ha Ha Ha Ha Ha Ha Ha ha ha ha

一个slr(1)的 语法分析器 可以自行输入文法-1 slr (1) parser can enter your own grammar

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

本手册讲述对8051 的目标环境如何使用Cx51 优化C 编译器编译C 程序Cx51 编 译器包可以用在所有的8051 系列处理器上可以在WINDOWS 32 位命令行中执行本手 册假定你熟悉WINDOWS 操作系统知道如何编程8051 处理器并会用C 语言编程-This manual describes the target environment of the 8051 how to use the Cx51 optimizing C compiler to compile C program Cx51 compiler package can be used in all of the 8051 series of processors can be WINDOWS 32-bit command-line in the implementation of this manual assumes that you are familiar with WINDOWS operating system, know How do I program the 8051 processor and will use C language programming

编译原理实验中的工具BISON,可以再windows或者DOS下使用-Compilation Principle Experiment tools BISON, can be used under windows or DOS

语法分析器 java版 编译课程综合训练-Java version of the compiler parser comprehensive training courses

这是一个很好的图书管理系统 数据库SQL2005-e i fjfianidfn ldsif ldno lviv livdf