1. 构造一小型C语言SimpleC的编译器软件，达到综合理解和运用编译原理课程所讲解的关键过程（词法分析、语法分析、静态语义分析、代码生成）及相关算法的目的。...

该文件主要是一个编译原理函数语言绘图器，可以利用起来翻译图象代码-the document is mainly a function of compiler theory language mapping device that can use up images code translation

编译原理词法分析的电子文档-compiler theory lexical analysis of electronic documents

编译原理程序,请多指教。- The translation principle procedure, please much advises.

ec++,嵌入式C++编译器，和KEIL结合的很好的，开发过程也比较简单，压缩包中包含说明文档。-ec++, embedded C++ compiler, and KEIL good combination, the development process is also relatively simple, compressed package includes documentation.

附录A S语言说明 A．1 字符集的定义 3数据类型定义-language A. A definition of the character set of data type definition

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

用于进行递归下降分析法，编译原理，运行环境为Visual Stdio c++6.0-Be used for recursive descent analysis, compiling principle, operating environment for Visual Stdio c++6.0

这是一个简单的C编译器的词法分析和语法分析。-This is a simple C-compiler of lexical analysis and parsing.

一个简单的词法分析器，1代表字符，2代表关键字（命令字），4带表算符界符， 注：要把wangs.txt这个文件放在桌面上，然后在这个TXT里写上你要识别的语句。然后保存后关毕，在运行WANG词法分析.EXE进行词法分析。 完成识别后，会在相应的词面前出现以上代号。暂不能对数字进行识别。因为在某种请况下数字也可表是为字符……稍有困难，但完成老师的针对程序段：area=b+c*d。那简直是小菜一碟。-a simple lexical analyzer, a representative character, the two representatives keyword (command word), with four tables operator sector website Note : The wangs.txt the document on the desktop, then the TXT Lane write you to identify words. Then preserved customs Albert, running WANG lexical analysis. EXE for lexical analysis. After completing the identification, in the appropriate words appear in front of the above code. Provisional figures for the right not to identify. Because of the status of requests under certain figures might be for the characters ... the slightest difficulty, but the completion of procedural teachers : area = b, c* d. It is simply to touch.

简单整型表达式文法按递归下降方式设计其编译程序，生成PL/0栈式指令代码，然后解释执行-simple integer expression by recursive grammar dropped to design its compiler, generating PL/0 Stack-code instructions, and then the interpretation and implementation of