资源列表
cffxq
- 词法分析器,主要完成编译原理中的词法分析-lexical analyzer
yufa
- 编译原理,独立的语法分析器,有token串,预测分析法-Compiler theory, an independent parser, a token string, predictive analysis
decoder38
- 用时序电路写的3/8译码器,初学者范本,很简单的小程序-Written in sequential circuits using 3/8 decoder, beginner model, a very simple applet
decoder3to8
- 用组合逻辑电路写的3/8译码器,非常简单,是初学者可以看看的-Written with a combination of logic circuit 3/8 decoder is very simple, a beginner can look at the
5090309275_1
- 创建一个名为Complex的类,进行复数的运算。Complex需要具有的功能:提供一个构造函数,它使这个类的对象在声明时得以初始化; 提供一个拷贝构造函数用来创建对象; 两个Complex的加法;实部相加,虚部相加; 两个Complex值相减:实部相减,虚部相减 两个Complex值相乘 以(a + b * i)的形式打印Complex的值,其中a为实部,b为虚部。-Create a class called Complex to carry out complex calc
python-3.2
- python-3.2安装文件 -python-3.2 installation filepython-3.2 installation file
Grammar-analysis
- 语法分析的C++实现 编程环境VC6.0-Grammar analysis to achieve
PBkiller
- 反编译 pb kill,可以方便的编译的呀-Decompile pb kill, can easily compile the ah
Compilation
- 编译过程 讲解编译过程 分解编程步骤 有利于学习-Explain the process of decomposition of the build process compiled programming steps conducive to learning
C-MINUS
- 词法分析代码,是基于c++环境的词法分析,是需要输入文件,输出文件来进行的 -Lexical analysis code
C_Minus
- 输入cminus字符流文件,输出单词文件-Enter cminus character stream file, the output word document
RecursiveDescentParser
- 以下描述算术表达式的LL(1)文法的递归下降分析程序 G[E]: E→TE′ E′→ATE′|ε T→FT′ T′→MFT′|ε F→ (E)|i A→+|- M→*|/-The following descr iption of arithmetic expressions LL (1) recursive descent parser grammar G [E]: E → TE ' E' → ATE ' | ε T → FT' T