搜索资源列表
nibolanshi
- 逆波兰式,用于后缀表达式，计算上用到的比较多-Reverse Polish Notation for postfix expression, used in more computationally
Calculator
- 一个简单的计算复杂表达式的值，利用栈，将中缀表达式转化为后缀表达式-A simple calculation of the value of complex expressions, the use of the stack, the infix expressions into postfix notation
calculator
- 控制台应用程序，科学计算器。用来学习中缀表达式转后缀表达式。函数的输入需要一个字母一个字母的输入。-Console application, scientific calculator. Learning to turn postfix notation infix expression. Enter function requires a letter of an alphabet input.
infixtopostfix
- 利用java语言实现中缀表达式转后缀表达式，能判断操作符的优先级，把括号去掉，可以接受空格的输入。-Java language use infix expression turn postfix notation, the operator can determine the priority of the brackets removed, can accept input space.
expression-evaluate
- 将中缀表达式转换成后缀表达式，再将后缀表达式求值-Convert infix expression into postfix notation, then postfix expression uation
p1
- compute expression in postfix notation and output the result. You may use std::stack to implement the program.