搜索资源列表
postfix
- implementation of infix to postfix algorithm
intopost
- c++ codes that converts an infix expression to postfix expression
InfixToPostfix
- infix to postfix expression
Assignment-2-final
- conversion between infix, prefix and postfix
stack2
- converts to postfix from infix
ExpressionTest
- 中缀表达式转后缀表达式基本思路是：用一个链表 List 储存将要生成的后缀表达式；用一个栈 Stack 储存操作符；判断当前节点， 如果是操作数， 直接加入后缀表达式中， 如果是操作符，则比较前一个操作符和当前操作符的优先级…… -Infix expression basic idea is to switch to postfix expression: list List with a store that will be generated by postfix expression
biaodashiqiuzhi
- 通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value.
zhongzhui
- 本程序能将运算式从中缀表达式转换为后缀表达式，并计算运算式的值。暂时仅可计算正整数之间的运算。暂时无法处理负数，要计算负数请用 (0-n) 的形式。输入仅含数字0~9及+、-、*、/、(、)的式子，并在结尾处加 # 字作为结束符。-This program can convert an expression from infix expressions to postfix expressions, and calculate the expression value. Calculate th
InfixToPrefixConversion
- program to convert infix to postfix
ProExpr
- 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
Infix_expression
- 编写一程序直接计算任意输入的中缀表达式的值，且不能采用先转换到后缀表达式再计算的方式。-Procedures for the preparation of a direct calculation of arbitrary input infix expression values, and can not be converted to a postfix expression using the first re-calculated way.
PPT4
- 编写程序实现将中缀算术表达式转为后缀表达式,并利用栈和后缀表达式计算表达式的值-Programming to achieve infix arithmetic expressions to postfix expressions, postfix expression using stack and calculate the value of the expression
Infix-to-Postfix
- infix to postfix expression in C
zhongzhui
- 通过栈实现将表达式转换为后缀，并可以计算中缀表达式和后缀表达式的求值-Through the stack to achieve the expression into postfix, and infix expressions can be calculated and postfix expression evaluation
infix-to-postfix-and-evaluated
- C++源码。输入中缀表达式，将其转成后缀表达式并求值。-C++ source. Enter the infix expression to turn them into postfix expression evaluation.
Infix-to-postfix
- 中缀转后缀表达式，编译原理实验。 递归下降分析法实现。-Infix to postfix expression, the compiler of principle experiment. Recursive descent analysis.
Infix-to-suffix-arithmetic-expressio
- 输入一个中缀算术表达式S，S中的操作数为0到9，只含+，-和*，/运算，也可能含有括号()，运算符的计算顺序和实际四则运算的计算顺序相同. 输出与S等价的后缀表达式-Input an infix arithmetic expressions S, the S operand 0-9, containing only+,-,*,/operator may also contain brackets (), the same order as the operator of the calculat
CPP-into-postfix-expression
- 这个程序是用C++编写的，编写时用到的环境是VC++6.0,程序作用是将中缀表达式转换为后缀表达式-This program is written in C++, when used in the preparation of the environment is VC++6.0, the role of the program is to convert infix expression postfix expression
calculator
- 控制台应用程序，科学计算器。用来学习中缀表达式转后缀表达式。函数的输入需要一个字母一个字母的输入。-Console application, scientific calculator. Learning to turn postfix notation infix expression. Enter function requires a letter of an alphabet input.
Convert-infix
- 问题描述 中缀表达式就是我们通常所书写的数学表达式，后缀表达式也称为逆波兰表达式，在编译程序对我们书写的程序中的表达式进行语法检查时，往往就可以通过逆波兰表达式进行。我们所要设计并实现的程序就是将中缀表示的算术表达式转换成后缀表示，例如，将中缀表达式 (A 一 (B*C 十 D)*E) ／ (F 十 G ) 转换为后缀表示为： ABC*D十E* FG十／ 注意：为了简化编程实现，假定变量名均为单个字母，运算符只有＋，－，＊，／ 和＾（指数运算