搜索资源列表
DataStruct_expresion
- 实现把原表达式分别用中缀,后缀,前缀三个形式表达,并分别求值-Were used to achieve the original expression infix, suffix, prefix the three forms of expression, and were evaluated
Stack_Expression
- 表达式求值,中缀表达式转成后缀,根据后缀表达式求出表达式的值-Expression evaluation, expression conversion infix postfix, postfix expressions obtained under the value of the expression
suffix
- 实现中缀表达式到后缀表达式的转换,并求值-Midfix turn to suffix and solve it
lab1
- 数据结构,中缀表达式转后缀表达式并求值 用链表构造堆栈实现-in-post
main
- 表达式求值*** 将中缀表达式转换为后缀表达式。假设输入的算法表达式的运算符只有“+、-、×、/、(、)”这几种。 要求:用栈完成;首先要判断输入的表达式括号是否配对,在正确表达式的基础上转换为后缀表达式,然后计算结果。 -*** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expressio
shiyanwwu
- 则运算式求值,将四则运算式用中缀表达式表示,然后将它转变成后缀表达式,并且计算结果。 2、 基本要求:要求运用二叉树来实现。 -The expression is evaluated, the four expressions that use the infix expression, and then to transform it into a postfix expression, and results. 2, the basic requirements: Requir
postfix
- 用Stack类来实现中缀表达式转化为后缀表达式,并且根据后缀表达式求值-With the Stack class to implement an infix expression into postfix expression, and expression evaluation according to the suffix
main
- 输入中缀表达式 输出后缀表达式 并求值-Input infix expression postfix expression and evaluates the output
homework
- (1)从键盘输入任意一个语法正确的(中缀)表达式,显示并保存该表达式。 (2)利用栈结构,把上述(中缀)表达式转换成后缀表达式,并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构,对上述后缀表达式进行求值,并显示栈的状态变化过程和最终结果。-(1) keyboard input either from the right syntax (infix) expressions, display and save the expression. (2) the use
expressionEvaluation
- 1)从键盘输入任意一个语法正确的(中缀)表达式,显示并保存该表达式。 (2)利用栈结构,把上述(中缀)表达式转换成后缀表达式,并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构,对上述后缀表达式进行求值,并显示栈的状态变化过程和最终结果。-1) input from the keyboard correct any syntax (infix) expressions, display and save the expression. (2) the use of
Expression-and-derivation
- 以字符序列的方式从终端输入语法正确的,不含变量的整数表达式。利用中缀表达式变为后缀表达式的求值算法实现对算术四则混合运算表达式求值,并演示出在求值中运算符栈,操作数栈,输入字符和主要操作的变化过程。-The way to sequence of characters from the terminal input grammar correctly, do not contain variables integer expression. Use midfix expression of the
zhongzhui
- 通过栈实现将表达式转换为后缀,并可以计算中缀表达式和后缀表达式的求值-Through the stack to achieve the expression into postfix, and infix expressions can be calculated and postfix expression evaluation
biaodshiqiuzhi
- 表达式求值。输入一个中缀表达式,程序能把它转换成后缀表达式,然后求值。-Expressions. Enter an infix expression, the program can convert it into a postfix expression and then evaluated.
Infix-into-postfix-expression
- 中缀表达式转换为后缀表达式,并且求值,使用C++代码编写-Infix expression into postfix expression
1
- 算术表达式求值:输入中缀表达式,转换成后缀表达式后求值-Arithmetic expressions are evaluated: input midfix expression, converted into a suffix after expressions are evaluated
calculator
- 本程序实现了用中缀转后缀做表达式求值的算法支持函数运算 支持括号/函数嵌套 是数据结构课本中简单带括号的四则运算表达式求值的深入版-This program implements the algorithm supports infix to suffix expression evaluation function calculation support brackets/functions nested data structures textbook in simple In-dept
zToH
- 中缀表达式转后缀表达式并求值 C++ 数据结构 链栈应用-Infix expression to turn suffix expression and to find the value of C++ data structure of the chain stack application
Expression-evaluation
- 任意输入数学运算表达式分别采用两种算法求值,分别是中缀表达式直接求值和修改成后缀表达式求值。表达式中包含的运算符有:加法+,减法-,乘法*,除法/,括号(),乘方#等运算符。运算符的优先级和结合性符合数学运算法则-Any input math expressions using two algorithms evaluated, infix expression directly evaluated and modified the postfix expression evaluation.
main
- 利用栈的知识解决表达式求值问题,并将中缀表达式转化成后缀表达式求值-Stack knowledge to solve the problem of expression evaluation, and infix expression into postfix expression evaluator
infix-to-postfix-and-evaluated
- C++源码。输入中缀表达式,将其转成后缀表达式并求值。-C++ source. Enter the infix expression to turn them into postfix expression evaluation.