一种罕见的Z80目标机器的编译器源码，是学习理论和实践经验…

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

一个编译器的模拟程序,有词法分析,语法分析,语义分析,以及目标代码的生成-A compiler of the simulation program, has lexical analysis, syntax analysis, semantic analysis, and object code generation

ll1语法分析的c语言实现代码 需要输入词法分析的txt结果文件-ll1 the grammar analysis c language realization code needs to input the lexical analysis the txt result document

这是一个功能完善的可编译DOS下和windows下的tiny-c编译器。里面有可执行文件可以试验。源码非常清晰，值得研究。-This is a fully functional that can be compiled under DOS and windows under the tiny-c compiler. Inside the executable file can experiment. Source code is very clear and worth studying.

经典的基于Context-Free_Grammer 的语法分析器。-Based on the classic of the Context-Free_Grammer grammar analyzer.

Turbo Pascal 6.0编译器源码 -The source of Turbo Pascal 6.0 compiler

采用递归下降子程序书写的编译原理关于“PL0文法”的编译器，支持词法分析语法分析目标代码生成-grammar

Fenris是一个检测并把高层次的语言结构做成文档的多功能故障检测器、调试器、代码分析工具。它能回复符号，把程序执行流绘成图，检查内部运行情况，恢复符号表，并处理反调试保护。它有一个命令行接口和一个类似SoftICE的GUI与Web前端-Fenris is a detection and high-level language structure made of multifunctional document fault detection, debugging, code analysis tools. It can restore symbols, compose program execution flow map, check their internal operations, restoration of the symbol table, and to deal with anti-debugging protection. It is a command line interface and a similar SoftICE with the GUI front-end Web

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

编译原理实验程序C语言版本- Translation principle test run C language edition