pl0编译器

我做的不好呀，请大家指教。- I do am not good, asks everybody to advise.

这是编译原理的词法分析源程序- This is translates the principle the lexical analysis source program

词法分析 从字符串表示的源程序中识别单词符号-Lexical analysis of source code from a string that identify word symbols

C语言编写的简单的将汇编语言文件转化为单词二元式流文件的小软件。-，，

卷积码编码器的实现，是误码性能分析的一部分-Implementation of convolutional encoder

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

构造LR(1)分析程序，利用它进行语法分析，判断给出的符号串是否为该文法识别的句子，了解LR（K）分析方法是严格的从左向右扫描，和自底向上的语法分析方法。-tectonic LR (1) analysis procedure, and use it for syntax analysis, judgment, given the string of symbols to whether the sentence grammar recognition, understanding LR (K) analysis method is strict scan from left to right, and bottom-up syntax analysis.

实现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语言编译器，具备识别C语言基本语句功能，并生成四元式-Since the definition of simple types of C language syntax compiler, a statement to identify the basic functions of C language and generate quaternion type

查看asn1 ber编码方式的源文件，有多种查看方式-Show asn1 ber encoding the source file, there are several ways to view