搜索资源列表
zhongzhuidaohouzhui
- 实现编译原理中缀到后缀的c++程序源代码 实现编译原理中缀到后缀的c++程序源代码-Compiling principle to achieve infix to suffix c++ Compile source code to achieve the principle of infix to suffix c++ Source code
InToPost
- 中缀表达式转换成后缀表达式算法，并求算术表达式的方法。-Infix expression into the expression suffix algorithm, and methods for arithmetic expressions.
siyuanshi
- 中缀表达式转换成四元式的代码，用C语言实现的-Infix expression into a quaternion-based code, using C language realization of the
SOURCE
- convert infix expression to post fix expression and evaluate post fix expression
good
- 简单的将中缀到后缀的转换，一般是编译实验的第一次实验，主要是递归下降法-Simple to convert infix to suffix is generally compiled the first experimental test
compiler_infi_into_suffixform
- 编译原理课程实验：将简单中缀算术表达式变换成：（1）后缀形式；（2）生成书上描述的抽象堆栈机的代码；（3）对常量算术表达式，输出结果 -Compiler theory course experiment: a simple infix arithmetic expressions transform into: (1) suffix form (2) generate an abstract descr iption of the book stack machine code (3)
ReversePolishNotation
- 中缀表达式转换为逆波兰表达式，并计算逆波兰式结果。-Infix expression into Reverse Polish expression, and calculate the Reverse Polish Notation results.
4
- It is based on infix to postfix evaluation.
ex1
- 《编译原理》表达式翻译器 构造一个中缀表达式到后缀表达式的翻译器，初步了解递归下降语法分析原理及语法制导翻译的过程。-Compiler theory expression translator construct an infix expression to postfix expression translator, a preliminary understanding of recursive descent parsing principle and Syntax translation
1
- 编译原理实验 表达式翻译器:一个中缀表达式到后缀表达式的翻译器 表达式文法及其翻译模式定义如下： expr expr + term {print(‘+’)} | expr - term {print(‘-’)}| term term term * factor {print(‘*’)} | term / factor {print(‘/’)} | factor factor ( expr ) | id {print(id.
zhongzuidaohouzui
- 这是一份关于编译原理的中缀到后缀的代码，很不错，对于刚学习的学生来说有借鉴价值！-This is a compiler theory of infix to suffix code, very good reference value for students who are just learning!