搜索资源列表
2
- 逆波兰式表示法的生成程序，挺好的！实现了从中缀向后缀的转变-Reverse Polish Notation notation generation process, quite good! Realized the transformation from infix to suffix
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
infixToprefix
- This source code is used for make infix expression from prefix expression by using assembly and C language together.
InToPost
- 中缀表达式转换成后缀表达式算法，并求算术表达式的方法。-Infix expression into the expression suffix algorithm, and methods for arithmetic expressions.
1
- C++语言编的表达式求值-中缀表达式转为后缀表达式-C++ language for evaluation of the expression- expression to infix expressions suffix
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
txt
- 利用栈及简单语法将中缀式转为逆波兰式 即使是初学者也能看懂-The use of the stack and a simple syntax infix style to Reverse Polish Notation, even beginners can understand
LZ78encodinganddecoding
- LZ78的编码思想是不断地从字符流中提取新的“缀-符串(String)”（通俗地理解为新“词条”），然后用“代号”也就是码字(Code word)表示这个“词条”。这样一来，对字符流的编码就变成了用码字(Code word)去替换字符流，生成码字流，从而达到压缩数据的目的。 -LZ78 encoding idea is to continually extracted from the character stream the new " infix- character string
good
- 简单的将中缀到后缀的转换，一般是编译实验的第一次实验，主要是递归下降法-Simple to convert infix to suffix is generally compiled the first experimental test
Calculator
- c++语言编写的计算器程序，可以实现加减乘除，不过不支持双位数，使用堆栈编写，含有中缀表达式到后缀表达式的转换。-c++ language calculator program, Math can be achieved, but does not support double-digit, use the stack preparation, with infix expression to postfix expression converter.
huizhuishi
- 中缀式转换成后缀式 基于语法制导翻译的表达式转换编译器-Postfix infix conversion into a translation type expression based Syntax compiler transformation
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.
qiuzhi
- 本实验的目的就是设计一个表达式求值的程序，程序中能接受包含（，），+，-，*，/， ，^的中缀表达式，从文件中读取算术表达式，并求出算术表达式的结果，在另一文件里输出-The purpose of this study is to design an expression evaluation process, the program can accept include (,),+,-,*,/, ,^ the infix expressions, arithmetic expressions
zhong_zhuan_hou_calc
- 输入中缀表达式，转换为后缀表达式，并计算出结果-Input infix expression into postfix expression, and calculate the results
mpi-trans
- changing infix notation to prefix notation when calculating
ex1
- 《编译原理》表达式翻译器 构造一个中缀表达式到后缀表达式的翻译器，初步了解递归下降语法分析原理及语法制导翻译的过程。-Compiler theory expression translator construct an infix expression to postfix expression translator, a preliminary understanding of recursive descent parsing principle and Syntax translation
infix-to-postfix
- 中缀表达式转后缀表达式，只做了数字，没有考虑字母的情况-infix to postfix