Description: 中缀表达式 后缀表达式：不包含括号，运算符放在两个运算对象的后面，所有的计算按运算符出现的顺序，严格从左向右进行-Infix expression postfix expression: does not contain parentheses, operator on two operands in the back, all the calculations appear in the order according to operator, strictly from left to right to Platform: |
Size: 1024 |
Author:张臻 |
Hits:
Description: Java版运算表达式解析器
主要功能:
对有括号的四则运算解析并求解.
支持多种表达式类型
思路:
1.把中缀表达式转化成后缀表达式
2.从后缀表达式得到解
注意:
该版本只支持1.6JDK,如果想替换成1.5JDK改替换LinkedList的几个方法就行了.
详细内容:
http://jomper.javaeye.com/blog/464906-Java version of computing expressions parser main functions: to have the brackets, and four computing analytic solution. Supports a variety of types of ideas the expression: 1. The infix expression into postfix expression 2. Postfix expression is obtained from the solution Note: This version only supports 1.6JDK, If you want to make changes to replace LinkedList replaced 1.5JDK several methods on the list. Details: http://jomper.javaeye.com/blog/464906 Platform: |
Size: 2048 |
Author:jomper |
Hits:
Description: 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate Platform: |
Size: 48128 |
Author:秦朔 |
Hits:
Description: 后缀表达式Postfix,将终端用户输入的一个中缀表达式转换为等价的后缀表达式后输出；若用户输入的表达式有误，则程序的输出是无意义的，但该程序不会提示用户输入有误。-Postfix expression Postfix, the end-user input infix expression into an equivalent postfix expression is the output if the user enters the expression is wrong, the program' s output is meaningless, but the program does not prompt user input is wrong. Platform: |
Size: 263168 |
Author:洪闻涛 |
Hits:
Description: 实验要求把中缀表达式转换成为后缀表达式，然后再对后缀表达式求值。其中要利用栈，数组等。-Experimental requirements to convert infix expression into postfix expression and then evaluate the expression of the suffix. Which make use of the stack, the array and so on. Platform: |
Size: 2048 |
Author:haha |
Hits:
Description: 表达式求值***
将中缀表达式转换为后缀表达式。假设输入的算法表达式的运算符只有“＋、－、×、/、（、）”这几种。
要求：用栈完成；首先要判断输入的表达式括号是否配对，在正确表达式的基础上转换为后缀表达式，然后计算结果。
-*** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expression of only " +,-,×,/,(,)" these types of operators. Requirements: completion of the stack we must first determine whether the pair enter the expression in brackets in the right on the basis of the expression into postfix expression, then calculate the results. Platform: |
Size: 2048 |
Author:Li |
Hits:
Description: 用Stack类来实现中缀表达式转化为后缀表达式，并且根据后缀表达式求值-With the Stack class to implement an infix expression into postfix expression, and expression evaluation according to the suffix Platform: |
Size: 2269184 |
Author:aerin |
Hits:
Description: 2-9进制的数字转换
中缀表达式转换为后缀表达式
字符串中字母的频率及排序
括号配对的验证
链表式储存及功能-2-9 band of the digital conversion infix expression into postfix expression string and sort the letters in parentheses matching the frequency of verification of storage and features list Platform: |
Size: 889856 |
Author:zhangjing |
Hits:
Description: 表达式求值是程序设计语言编译中的一个最基本问题。与人们习惯的中缀表示的表达式相比,后缀表达式不存在括号,没有优先级的差别,表达式中各个运算是按照运算符出现的顺序进行的。因此非常适合串行工作的计算机处理方式。该文首先对这两种表达式表示方法进行了分析比较,然后通过具体分析实现这两种表达式求值的算法来论证表达式后缀表示优于中缀表示。最后简要谈一下中缀表达式到后缀表达式的转换。-Evaluation of the expression is a basic problem in the programming language compiler. Compared to people accustomed to infix expressions, postfix expression does not exist in parentheses, no priority difference, the various arithmetic expression is carried out in accordance with the order of appearance of the operator. Therefore very suitable for computer processing of the serial work. In this paper, the analysis and comparison of both expressions representation of these two expressions evaluated algorithm, and then through a concrete analysis to demonstrate that the expression suffix indicates better than infix. Finally, a brief talk about infix expression to postfix expression conversion. Platform: |
Size: 130048 |
Author:逆水之寒 |
Hits:
Search - infix expression postfix expression