搜索资源列表
Stack_Expression
- 表达式求值,中缀表达式转成后缀,根据后缀表达式求出表达式的值-Expression evaluation, expression conversion infix postfix, postfix expressions obtained under the value of the expression
suffix
- 实现中缀表达式到后缀表达式的转换,并求值-Midfix turn to suffix and solve it
main
- 输入中缀表达式 输出后缀表达式 并求值-Input infix expression postfix expression and evaluates the output
homework
- (1)从键盘输入任意一个语法正确的(中缀)表达式,显示并保存该表达式。 (2)利用栈结构,把上述(中缀)表达式转换成后缀表达式,并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构,对上述后缀表达式进行求值,并显示栈的状态变化过程和最终结果。-(1) keyboard input either from the right syntax (infix) expressions, display and save the expression. (2) the use
zhongzhui
- 通过栈实现将表达式转换为后缀,并可以计算中缀表达式和后缀表达式的求值-Through the stack to achieve the expression into postfix, and infix expressions can be calculated and postfix expression evaluation
Infix-into-postfix-expression
- 中缀表达式转换为后缀表达式,并且求值,使用C++代码编写-Infix expression into postfix expression
main
- 利用栈的知识解决表达式求值问题,并将中缀表达式转化成后缀表达式求值-Stack knowledge to solve the problem of expression evaluation, and infix expression into postfix expression evaluator
infix-to-postfix-and-evaluated
- C++源码。输入中缀表达式,将其转成后缀表达式并求值。-C++ source. Enter the infix expression to turn them into postfix expression evaluation.
stack
- 中缀表达式转化为后缀表达式并求值,代码很长,原创-Using Stack to convert the middle expression to end expression
postfix-expression-evaluation-
- 后缀表达式求值,将中缀表达式转换成后缀表达式,然后求值-Postfix expression evaluation infix expression into postfix expression and then evaluated
poj-5346-
- poj 5346题,四则运算表达式求值的实现,用栈和队列实现中缀转后缀后计算,含解题报告与源码-poj 5346 title, the realization of the four arithmetic expression evaluation calculated decorated in a stack and queue implementations turn suffix containing the report and the source of problem-solving
zhongzhuihouzhuizhuanhuan
- 演示用算符优先法对算术表达式求值的过程。 (1)从键盘输入任意一个语法正确的(中缀)表达式,显示并保存该表达式。 (2)利用栈结构,把上述(中缀)表达式转换成后缀表达式,并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构,对上述后缀表达式进行求值,并显示栈的状态变化过程和最终结果。 -Demonstration by operator precedence for arithmetic expression evaluation process. (1) fro
calculator
- 表达式• 表达式树• 表达式求值 输入一个中缀表达式及中缀表达式中字母代表的数值,包含+ - * / 运算符,(),首先转成后缀表达式,然后画出表达式树,最后输出表达式求出的值-Expression expression tree • expression evaluation input the values of the letters on behalf of an infix expression infix express
expression-transferring
- 中缀表达式转换为后缀表达式并进行求值,有界面和按钮的完整程序-Infix expression into a postfix expression and evaluation
24-point-embedded-simple-calculator
- 24点内简易计算器的实现。中缀表达式变为后缀表达式然后求值-Simple calculator within the 24-point implementation. Infix expression into postfix expression is then evaluated
expression
- 表达式求值利用中缀表达式翻译成后缀表达式进行求值!-Expression is evaluated using the infix expression translated into postfix expression is evaluated!
translate
- 本代码可以对一般的中缀式进行转化,转为前缀式,后缀式并分别对它们求值。该程序是在vs2010上调试通过的,而且只有源代码。-This code can in general infix style was transformed into a type prefix, postfix and evaluate them separately. The program is in vs2010 debugging through, and only the source code.
expvalue
- 该程序主要实现了表达式求值,将中缀表达式转为后缀表达式。-The program achieved a major expression evaluation, the infix expression into postfix expression.
lab1-Calculator
- 四则运算求值 求表达式的值的基本思想就是 后缀表达式求值以及如何实现 Knuth 将此概括为三个步骤: 对中缀表达式进行语法分析 中缀表达式到后缀表达式的转换 对后缀表达式求值 思路:首先利用栈A把四则运算的字符串从中序表达式转换成后序表达式;然后对后序表达式,如果是数字则保存到另一个栈B中,如果是运算符(+,-,*,/)就从栈B中依次获取栈顶两个操作数进行运算,运算结果再压栈B,如此反复,最终栈B中最后的值就是运算结果。-Cacluate t
expression-evaluate
- 将中缀表达式转换成后缀表达式,再将后缀表达式求值-Convert infix expression into postfix notation, then postfix expression uation