pl0语言编译器及从中分离的语法分析程序

判断a^mba^n m,n=0的字符串- Judges a^mba^n m, the n=0 character string

简单整型表达式文法按递归下降方式设计其编译程序，生成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

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

编译原理-文法等价转换-compiler theory- grammar Conversion

NT上的Perl解释器 -Perl interpretor on NT

pl 词法分析器，自己编的，输入文件名 （包括后缀）即可-pl morphology analyzer, own arrange, the input filename (decorates including after) then

对于dos下asm编程的初学者很有帮助，只需用到两个应用程序。-For asm programming under dos helpful for beginners, simply use two applications.

状态转换矩阵 用来判断运算符的正确性- The phase transition matrix uses for to judge the operator the accuracy

一个简单的命令行解释器- A simple order good interpreter

简单的LL（1）的分析，具体可见程序，有过程，一目了然，谢谢指教-simple LL (1) analysis, we can see specific procedure, a process, clear, thank you enlighten