Description: A small program for demonstrating the Postfix notation, you can input the postfix equation in the command window Platform: |
Size: 393216 |
Author:Yafeng |
Hits:
Description: Advanced calculator which uses Postfix notation in order to parse math formulas. It can also draw a result. Platform: |
Size: 25600 |
Author:lpu |
Hits:
Description: 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. Platform: |
Size: 9216 |
Author:net7 |
Hits:
Description: implement a routine that takes an infix notation expression, converts it to postfix through an expression tree, and then evaluates the postfix notation. Platform: |
Size: 4096 |
Author:mike |
Hits:
Description: 逆波兰式,用于后缀表达式，计算上用到的比较多-Reverse Polish Notation for postfix expression, used in more computationally Platform: |
Size: 692224 |
Author:jiangzuolin |
Hits:
Description: 一个简单的计算复杂表达式的值，利用栈，将中缀表达式转化为后缀表达式-A simple calculation of the value of complex expressions, the use of the stack, the infix expressions into postfix notation Platform: |
Size: 3072 |
Author:从陆文 |
Hits:
Description: 控制台应用程序，科学计算器。用来学习中缀表达式转后缀表达式。函数的输入需要一个字母一个字母的输入。-Console application, scientific calculator. Learning to turn postfix notation infix expression. Enter function requires a letter of an alphabet input. Platform: |
Size: 3072 |
Author:Horus |
Hits:
Description: 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中的算符优先分析算法，结合上面给出的语义动作实现逆波兰式的构造；
3、利用栈，计算生成的逆波兰式，步骤如下：
1）中缀表达式，从文本文件读入，每一行存放一个表达式，为了降低难度，表达式采用常数表达式；
2）利用结合语法制导翻译的算符优先分析，构造逆波兰式；
3）利用栈计算出后缀式的结果，并输出；-1 gives grammar as follows: E [E] E-> T | E+ T T-> F | T* F F-> i (E) the corresponding inverse Polish into semantic action as follows:
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, the use of experimental 5 operator priority analysis algorithms, combined with semantic actions given above structure to achieve reverse Polish notation
3, the use of the stack, calculates the resulting Reverse Polish Notation, as follows:
1) infix expression, read a text file, each line deposited an expression, in order to reduce the difficulty of using a constant expression expression
2) the use of binding syntax directed translation of operator priority analysis, structural inverse Polish
3) Using the calculated postfix stack of results and outputs Platform: |
Size: 1024 |
Author:忆昔 |
Hits:
Description: 利用java语言实现中缀表达式转后缀表达式，能判断操作符的优先级，把括号去掉，可以接受空格的输入。-Java language use infix expression turn postfix notation, the operator can determine the priority of the brackets removed, can accept input space. Platform: |
Size: 1024 |
Author:chenhuibing |
Hits:
Description: 表达式计算是实现程序设计语言的基本问题之一，它的实现是栈的应用的一个典型例子。设计一个程序，演示通过将数学表达式字符串转化为后缀表达式，并通过后缀表达式结合栈的应用实现对算术表达式进行四则混合运算。-
Expressions computing is one of the basic issues to realize programming language, its implementation is a typical example of an application stack. Design a program that demonstrates the string by a mathematical expression into postfix notation, combined with a stack of applications to achieve by postfix arithmetic expressions four mixed computing. Platform: |
Size: 43008 |
Author:yezongxi |
Hits:
Description: compute expression in postfix notation and output the result. You may use
std::stack to implement the program. Platform: |
Size: 1024 |
Author:daniel yang |
Hits:
Search - postfix notation