资源列表
javac
- GJC（Generic Java Compiler）编译器，sun公司发布的开源的工业级别的编译器。上传该开源代码，希望研究java编译器的同学提供帮助。-GJC (Generic Java Compiler) compiler, sun releases in the company's industrial revenue level of the compiler. Upload the revenue code, hope to find java compiler studen
RJ010408
- 学编译原理时的课程作业,里面包含抽象语法树和程序源代码.-school compiler theory courses at the operation, which contains an abstract syntax tree and source code.
PASCAL2C
- 把pascal程序转成C语言程序 把pascal程序转成C语言程序-pascal procedures to put into C language program pascal procedures to put into C language program put pas cal procedures conversion C Programming Language
avcloneServer
- av clone server flash mx
turboprog
- 使用Matlab，编程实现Turbo码的编码及其解码算法，并给出在AWGN信道下该信道编码的性能-use Matlab, Turbo programming code coding and decoding algorithm, and gives the AWGN channel under the Channel Coding Performance
complier_cws
- 一个简单的词法分析程序..可以分析一关键字,还可以保存跟打开文件-a simple lexical analysis procedure .. can be a keyword analysis, but also with the preservation of open files
SyntaxParse
- 能对输入的语句进行分析，执行简单的数学表达式-able to import the statement analysis, the implementation of a simple mathematical expression
AtsSimple
- 在你的程序中实现脚本功能,该脚本引擎名为Atscr ipt , 是类似于VBscr ipt 的语法, 在一些比VBscr ipt 更好用,更方便,性能更高,而且容易扩展,无需组件环境,-you in the process of achieving functional scr ipt, the scr ipt called Atscr ipt engines, VBscr ipt is similar to the syntax in VBscr ipt than better, more c
BIN2HEX__asm_my
- 进制转换的汇编代码，课程实验做的 比较好哦-base for the conversion of the code compilation, experimental courses do a Haoe
viterbi1111
- 维特比算法用于扩频信道译码，与Turboo码,卷积码，级联码构成编码系统-Viterbi Algorithm for spread spectrum channel decoding, and Turboo code, convolutional codes, concatenated coding system code constitute
tcm11111
- 格状编码调制是为解决卫星通信中信道噪声对接收的影响及带宽的限制而产生的，其将信道编码与调制很好的结合起来，并且能发挥各自的优点，这种方法在不增加带宽和相同的信息速率下可获得3~6dB的功率增益。-trellis coded modulation for satellite communications solutions Channel noise on the receiver bandwidth and the impact of the restrictions, it will chan
00002
- 并且在卷积码编码过程中，添零数为k1*(L-1)=2,(注：L=3)，再对序列进行图示的映射，可通过以下程序实现：-in convolution coding process, the number of zero-Tim k1 * (L-1) = 2, (Note : L = 3), then right sequence shows the mapping process can be achieved through the following :