SkipOOMiniJOOL教学语言的编译器前端，包含基本的语义检查（师弟师妹们可不要完全照抄，自己做才有提高，里面有你们师兄的名字，参照记得请师兄我吃饭:）-SkipOOMiniJOOL teaching language compiler front-end. includes basic semantic inspection (Shidishimei they could not simply copy themselves can do to improve, There are the names of your older, in the light please remember my senior dinner :)

单片机与PC机通信的程序，pc机程序用c语言来编写，单片机程序用汇编语言来编写-dfafdfa

针对几种语言的词法分析的一点东东! 望接纳!-against several languages lexical analysis 1:00 Eastern! Wang accepted!

basic解释器源代码 microsoft visual studio 6.0环境下通过-basic explanation for the source code microsoft visual studio environment through 6.0

一个很有用的demo程序，对于学习单片机的朋友很有用的。-A useful demo program for learning Singlechip Friend very useful.

一个非常好的公式解析控件，没见过比这好的，支持自定义变量。为了上此站，才第一次拿出来-a very good formula Analytical Controls and have never seen than this good support from the definition of variables. To this point on, the first time out

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

使用Java语言实现Small Basic语言解释器。包括两个主要的子系统：一个是表达式解释器，负责处理数字表达式；另一个是解释器，负责程序的实际执行。-use Java language Small Basic language interpreter. Including the two major subsystems : an expression interpreter is responsible for handling digital expression; Another interpreter, responsible for the actual implementation process.

java写的词法分析器，写得不好别怪我-java writes the morphology analyzer, writes is not good do not blame me

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