搜索资源列表
20054674552
- 递归子程序法：对应每个非终结符语法单元编一个独立的处理过程（或子程序）。语法分析从读入第一个单词开始，由非终结符<程序>（即开始符）出发，沿语法描述图箭头所指出的方向进行分析。当-Recursive Subroutine law: at the end of the corresponding syntax for each non-unit provision of an independent process (or subprogram). Parsing from the f
Compiler1
- 使用C++编写的编译器，里面 包括了词法分析程序scanner.cpp，无符号数识别程序ucon.cpp，算符优先法语法语义处理程序SF.cpp，SLR1语法语义处理程序SLR1.cpp。比较强大。源程序输入有program.txt，输出包括窗口和compiled.txt-Using C++ to write compiler, which includes lexical analysis program scanner.cpp the number of symbols identifica
QPSK
- simulink搭建的A律13折现编译码仿真实现-The simulink to build A law 13 discount compiled code simulation implementation
pcm_coding
- 基于VHDL语言的a律13折线的编码，完成13位二进制码转换成8位码-Based on the VHDL language encoding of a law of 13 line
Fortran-program
- fortran code calculation of the arrow loaded plate a program to solve roots of the quadratic equation Estimated parameters of the Weibull law calculation of the mass of an electron study of the distribution of temperature in the wall of a f
NFA-DFA
- NFA转换为DFAjava版，功能齐全，求闭包，子集法-NFA converted DFAjava version, fully functional, seeking closure, a subset of the law