专门用来包装virtools文件的另一款工具,很好用的

C++电影票务系统附文的实现

Tiny C&C++,看看吧,也许用的着-Tiny C

一个比较全的词法分析器语法分析器。- A quite entire morphology analyzer grammar analyzer.

上课时老师用过的SNL编译器- Attends class when teacher has used SNL compiler

编译原理豪华版程序用VC++编写-compiler theory luxury version of the preparation procedures with VC!

用C++实现编译原理的递归下降语法分析 用C++实现编译原理的递归下降语法分析-C compiler to achieve the principle of recursive grammar analysis dropped C compiler to achieve the principle of recursive grammar analysis drop

C51编译器的一些优化设置资料，对初学者有些帮助，分享了给大家愿共同进步！-C51 compiler optimization settings some information, some help for beginners, to share to the U.S. is willing to make progress together!

词法分析程序，可对以下的C源程序进行分析：main() {int a[12] ,sum for(i=1 i=1 j--){ if(i==j&&i+j==13)sum+=a[i][j] } } printf("%c",sum) }-lexical analysis procedures, right below the C source code analysis : main () (int a [12] [12], the sum for (i = 1 ilt; I = 12) (for (j = 1 JLT; J = 12) Scanf ( "% d", a [i] [j])) for (i = 12 IGT; a = i--) (for (j = 12 IGT; = 1 j--) (if (i == ji j == 13) sum = a [i] [j])) printf ( "% c", sum

teste para poder baixar um aquivo

LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只需向右看一个符号便可决定如何推导，即选择哪个产生式(规则)进行推导。 LL(1)文法的判别需要依次计算FIRST集、FOLLOW集和SELLECT集,然后判断是否为LL(1)文法,最后再进行句子分析。 -LL (1) grammar using a set top-down analysis techniques. LL (1) the meaning is: the first one L shows a top-down analysis is a scan input string from left to right, the first two L shows the analysis process will be the most left-derivation, one that will be just right to see a sign can decide how to derive, choose what Production (rules) for derivation. LL (1) grammar, followed by calculation of the discriminant needs FIRST sets, FOLLOW sets and SELLECT set, and then determine whether to LL (1) grammar, the last sentence further analysis.