搜索资源列表
Stack_Expression
- 表达式求值，中缀表达式转成后缀，根据后缀表达式求出表达式的值-Expression evaluation, expression conversion infix postfix, postfix expressions obtained under the value of the expression
Infix_expression_into_postfix_expression_calculati
- 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate
lab1
- 实现中缀表达式转换为后缀表达式，实现了其基本的操作，刚刚完成-Convert infix expression to achieve postfix expression, achieved its basic operations, has just been completed
biaodashi
- 将简单中缀算术表达式变换成： （1）后缀形式 （2）生成书上描述的抽象堆栈机的代码 （3）对常量算术表达式，输出结果 -A simple infix arithmetic expressions transform into: (1) suffix form (2) generate an abstract descr iption of the book stack machine code (3) of the constant arithmetic expressions,
Postfix
- 后缀表达式Postfix,将终端用户输入的一个中缀表达式转换为等价的后缀表达式后输出；若用户输入的表达式有误，则程序的输出是无意义的，但该程序不会提示用户输入有误。-Postfix expression Postfix, the end-user input infix expression into an equivalent postfix expression is the output if the user enters the expression is wrong, the pr
calculator2
- 用C++编写的一个简单计算器，可以实现将中缀表达式转化为后缀表达式，并计算输出表达式的值，利用了STL中的栈-using C++ make a calculator which can used to make middle pression into fix pression and calculate the value
transform-nifix-expression-to-postfix-expression-w
- 利用栈将四则运算的中缀表达式（仅限于整数）转化为后缀表达式-Using the stack to transform four operations nifix expression (only integers) into postfix expression
ConvertToPostfix
- 用Java语言写的，使用堆栈，将中缀算术表达式转换成后缀表达式。-Written using Java language, using the stack, the infix arithmetic expressions into postfix expressions.
huizhuishi
- 中缀式转换成后缀式 基于语法制导翻译的表达式转换编译器-Postfix infix conversion into a translation type expression based Syntax compiler transformation
calculator
- 用mfc将一个中缀表达式转换成后缀计算，带计算键盘的-With mfc an infix expression into postfix calculation, with calculation of the keyboard
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)
Stack
- 用栈实现中缀转化为后缀表达式的C、C++程序。-Stack implementation using infix into postfix expression C, C++ program.
abstractstack
- 给定一个中缀表达式，要求转化为后缀表达式，并且生成抽象堆栈机的代码，完整代码加实验报告。-Given an infix expression into postfix expression requirements, and generate an abstract stack machine code, complete code and test reports.
main
- 表达式求值*** 将中缀表达式转换为后缀表达式。假设输入的算法表达式的运算符只有“＋、－、×、/、（、）”这几种。 要求：用栈完成；首先要判断输入的表达式括号是否配对，在正确表达式的基础上转换为后缀表达式，然后计算结果。 -*** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expressio
change
- 把中缀表达式转化为后缀表达式…… 第一行为T，表示有T组数据； 以下T行每行包含一个字符串，是中缀表达式。 对于每组测试数据数据后缀表达式。-Infix expression to postfix expression into the first act ... ... T, says there are T sets of data the following T lines each line contains a string, is the infix expres
MyStack
- 用Java语言实现的一个工作栈，并在其中可以完成输入后缀表达式，转换成中缀表达并计算结果-Java language with a working stack, and enter a suffix in which the expression can be done, and to convert infix expression results
shiyanwwu
- 则运算式求值，将四则运算式用中缀表达式表示，然后将它转变成后缀表达式，并且计算结果。 2、 基本要求：要求运用二叉树来实现。 -The expression is evaluated, the four expressions that use the infix expression, and then to transform it into a postfix expression, and results. 2, the basic requirements: Requir
postfix
- 用Stack类来实现中缀表达式转化为后缀表达式，并且根据后缀表达式求值-With the Stack class to implement an infix expression into postfix expression, and expression evaluation according to the suffix
zzbdsqz
- 中缀表达式求值，使用栈将中缀表达式转化为后缀表达式然后再进行计算 新手报到 -Infix expression evaluation, the use of the stack will be an infix expression into postfix expression and then calculated new to report ~~~~~~~
mid-lat
- 一个数学表达式，先输入中缀表达式然后变成后缀表达式，并求出这个式子的值-A mathematical expression, and then to enter the infix expression into postfix expression, and calculated the value of this formula