一个免费的编译器的原代码，用于学习lex和

this is about tiny python implementation

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

解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carries on the root to spread the calendar regarding this, after then obtains decorates the type

词法分析程序，可对以下的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

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

一个编译器的实现，是编译原理这门课的期末一个大作业-The realization of a compiler is the compiler of the principle of the course at the end of a big operation

基于控制台的词法分析器- Based on control bench morphology analyzer

m68k系列反汇编的C语言源码,供学习编译原理的同学使用。实用！-m68k series compiled by the C-language source code, the compiler theory for studying the students to use. Practical!

OllyMachine是在VC 6.0下开发的，请打开OllyMachine.dsp，然后按F7编译。它大约有10000行源代码，主要分成两个大类：Assembler和VM。

dump3 morpheus 0.2.9 src