1、输入串应是词法分析的输出二元式序列，即某算术表达式“实验项目一”的输出结果。输出为输入串是否为该文法定义的算术表达式的判断结果。 2、LL(1)分析过程

学生信息注册系统，数据库是ACCESS！-Student Registration information systems, databases are ACCESS!

输入已经消除左递归的以及提取公共左因子的LL(1)文法，再输入相应的表达式，若分析成功，则在递归输出过程中输出"acc",若不成功，则有相应的报错以及位置指名。注意，要把同一个非终结符的产生式分成单个输入。他会自动计算first,follow,预测分析表的构造，但并不输出。-importation has been eliminated and left recursive public from the left-LL (1) grammar, further importation of the corresponding expression, if the analysis is successful, the output of the recursive process output "belongs", if successful, there were errors and the corresponding location named. Attention, we should end with a non-escalation of production into a single input. He will be automatically calculated first, follow, and predicting and analyzing the table structure, but does not export.

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

cp计算机语言的 编译器的解释程序 用C++语言编写 -cp computer language compiler is the interpretation of the procedures used C language

在windows下应用的c语言编译器- Under windows application c language compiler

NASM是一个开源跨平台的汇编器。里面的源码有linux下和dos下的。包含一个NASM汇编教程，源码非常清晰，含少量汇编代码。-NASM is an open source cross-platform assembler. Inside the source code under linux and dos are under. NASM contains a compilation of tutorials, source code is very clear, with a small amount of assembly code.

ll1的词法分析实现,没有短语分析,只是确定是不是LL1文法.-ll1 achieve the lexical analysis, no phrase, is not only determined LL1 grammar.

卷积码的解码所用到的加比选模块 很有用 可直接引用-Decoding convolutional codes by using the plus selection module can be directly useful to quote

这是一个哈夫曼编译器,是我学数据结构的时候老师要求做的一个作业-This is a compiler Huffman, I studied the data structure when the teacher demanded an operations

VB Script脚本引擎及例子程序-VB Script engine and example program