搜索资源列表
计03_6_27张石
- 中缀表达式向后缀表达式的转化,并且具有求值的功能,有出错显示.-expression which is made up of the suffix to the conversion formula, and has evaluates the function, wrong show.
Untitled1
- 将中缀表达式转化为后缀表达式并求值，输出后缀表达式及值
中缀比表达式变后缀表达式再求值
- 此是 数据结构的课程中的一个经典的算法 -this is the data structure of the curriculum of a classical algorithm
表达式转换求值 C++
- 表达式的转换求值 利用栈 中缀表达式转后缀 直接将扩展名转为CPP即可调试运行
pp
- 中缀转后缀求值算法 有判断的代码部分-Infix to suffix evaluation algorithm has to determine the code part
calc
- 自己写的一个24点小游戏，其中用栈实现了中缀和后缀表达式求值，可以加以借鉴-Himself wrote a 24-point game, which used a stack infix and suffix expression evaluation can be draw
4
- 中缀表达式转化成后缀表达式并求值的算法，将中缀表达式转换为后缀表达式，顺利转换返回true，若转换过程中发现中缀表达式非法则返回false-Infix suffix expressions into expressions and evaluation algorithms, will be converted to infix expressions suffix expression, a smooth transition to return to true, if the convers
infixcaculator
- 根据用户输入的中缀表达式，将其转化为后缀表达式并求值。-Based on user input infix expression into a suffix of its expression and evaluated.
main
- 通过此源代码，能够实现如下功能：输入中缀表达式，实现后缀表达式的输出，然后求值-Through this source code, be able to achieve the following functions: Input infix expression, the expression of the output suffix implementation, then evaluation
1
- 实现中缀表达式转后缀表达式，并利用后缀表达式求值-Infix expression to expression algorithm suffix
Stack
- 栈的定义，C++定义的栈的基本操作 用于栈的操作练习 表达式求值，中缀转后缀-Stack
Expressionconversation
- 表达式转换，中缀表达式变后缀表达式并求值。有栈中内容变化说明。-Expression conversion infix postfix expression and the expression changes evaluated. There are changes in the contents of the stack instructions.
ProExpr
- 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
Expressionevaluation
- 表达式求值，有后缀表达式求值，中缀表达式直接求值，和中缀表达式间接求值-Expression evaluation, expression evaluation have the suffix, infix expression evaluation directly and indirectly infix expression evaluation
DataStruct_expresion
- 实现把原表达式分别用中缀,后缀,前缀三个形式表达,并分别求值-Were used to achieve the original expression infix, suffix, prefix the three forms of expression, and were evaluated
expression
- 实验要求把中缀表达式转换成为后缀表达式，然后再对后缀表达式求值。其中要利用栈，数组等。-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.
bool-value
- 求给定布尔表达式的真值,包括中缀转后缀，由后缀求值的运算。-Demand given the true value of the Boolean expression, including infix to suffix the suffix for the value of the operation.
zhongzhui
- 中缀转后缀求值。该程序只有代码，无注释，但程序简单易懂。结构清晰，结果正确，有一定容错性。-In infix turn suffix evaluated. The program only code, no comment, but the program is simple and easy to understand. Clear structure, the result is correct, some fault tolerance.
a
- 给定一个浮点数混合运算的中缀表达式，分别实现转换成为后缀表达式，然后求值；和直接对中缀表达式求值两种求值算法，并通过对给定测试集的实验，比较两种算法的效率差异并进行分析-Given mixed operation of a float infix expression, respectively, to achieve converted into postfix expression then evaluated , and infix expression evaluator two eva
pragma once
- 中缀表达式转后缀表达式并求值，C++，栈的应用，(expression evaluation)