搜索资源列表
PostfixConversion
- Calculator algorithm with postfix notation. Example of usage.
postfix1
- A small program for demonstrating the Postfix notation, you can input the postfix equation in the command window
zhongzhuizhuanhouzhui
- 中缀表达式转后缀表达式，数据结构中堆栈的应用。-Switch to postfix infix notation expressions, the data structure stack applications.
calc
- Advanced calculator which uses Postfix notation in order to parse math formulas. It can also draw a result.
src
- This program takes an equation in prefix,infix, or postfix mode with proper parenthesis and parses the equation into a binary tree to show which equations come first, then outputs the same equation back in prefix,infix, and postfix notation.
project2.tar
- implement a routine that takes an infix notation expression, converts it to postfix through an expression tree, and then evaluates the postfix notation.
nibolanshi
- 逆波兰式,用于后缀表达式，计算上用到的比较多-Reverse Polish Notation for postfix expression, used in more computationally
Project-Diva-4
- 课程作业, 将输入的前缀表达式转换为对应的逆波兰表达式(后缀表达式)-Course work, the prefix expression is converted to the corresponding input Reverse Polish Notation (postfix expression)
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.
postfix-notation
- 1、给出文法如下： G[E] E->T|E+T T->F|T*F F->i(E) 对应的转化为逆波兰式的语义动作如下： E-> E(1)op E(2) {E.CODE:= E(1).CODE||E(2).CODE||op} E->(E(1)) { E.CODE := E(1).CODE} E->id { E.CODE := id} 2、利用实验5中的算符优先分析算法，结合上面给出的语义动作实现逆波兰式的构造
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
Expressions-computing
- 表达式计算是实现程序设计语言的基本问题之一，它的实现是栈的应用的一个典型例子。设计一个程序，演示通过将数学表达式字符串转化为后缀表达式，并通过后缀表达式结合栈的应用实现对算术表达式进行四则混合运算。- Expressions computing is one of the basic issues to realize programming language, its implementation is a typical example of an application stack.
p1
- compute expression in postfix notation and output the result. You may use std::stack to implement the program.