搜索资源列表
3021121085_A
- 完成标准中缀算术表达式到后缀表达式的自动转换。-completed standard grade arithmetic expression of the suffix expression of an automatic conversion.
中缀比表达式变后缀表达式再求值
- 此是 数据结构的课程中的一个经典的算法 -this is the data structure of the curriculum of a classical algorithm
逆波兰表达式
- 计算用运算符后缀法表示的表达式的值。后缀表达式也称逆波兰表达式，比中缀表达式计算起来更方便简单些，中缀表达式要计算就存在着括号的匹配问题，所以在计算表达式值时一般都是先转换成后缀表达式，再用后缀法计算表达式的值。如：表达式(a+b*c)/d-e用后缀法表示应为abc*+d/e-。只考虑四则算术运算，且假设输入的操作数均为1位十进制数（0—9），并且输入的后缀形式表达式不含语法错误-calculated Operators suffix France said the value of the e
khss_Debug
- 带括号的算术表达式计算器．能完成一位数的带括号的算术表达式的运算，结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-bracketed arithmetic expression calculator. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack Implementation grade express
EvaluateExpression 算术表达式求值
- 算术表达式求值： 中缀表达式求值； 将中缀转换成后缀表达式并求值-Arithmetic expression evaluation: infix expression evaluation to infix into postfix expression and evaluates
FomulaStack
- 利用栈求解算术表达式的值，程序分为两种表达式，中缀式与后缀式，分别得用栈先入后出的特性，以及运算符的优先级比较，进行求解-use arithmetic to solve the value of the expression, procedures are divided into two expressions, and the sergeant-type suffix. Stack were starting after the first-in-the characteristics, a
convert
- 后缀式转中缀式 将由数字和四则运算符组成的后缀表达式变换为中缀表达式。 输入的后缀表达式包含的运算符不超过15个。 要求转换后的中缀表达式中不应出现不必要的括号。例如， 整个表达式两端的括号要省略，不影响原计算顺序的括号要省 略。-Suffix-type switch-type will be made up of four numbers and the composition operator for suffix expressions transform inf
InToPost
- 中缀表达式转换成后缀表达式算法，并求算术表达式的方法。-Infix expression into the expression suffix algorithm, and methods for arithmetic expressions.
sangzhi
- 中缀表达式改后缀表达式，同过先建立表达式树，再对其进行后序遍历-Infix to suffix expressions expressions have to create the same expression tree, and then after its traversal
Postmix
- 中缀表达式转后缀表达.It is a program that to change the postmix to midmix.-It is a program that to change the postmix to midmix.You can learn how computer do that thing throw this one.
tree
- 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conversion infix expression, and t
expressions
- 有关表达式的栈的应用 内容有：表达式括号匹配 计算后缀表达式的值 计算算术表达式的值 中缀表达式转后缀表达式-Expression of the application stack are as follows: the expression in brackets to match the calculated value of the suffix arithmetic expression expression is made up of expressions of
zhongzhuizhuanhouzhui
- 中缀表达式转后缀表达式，数据结构中堆栈的应用。-Switch to postfix infix notation expressions, the data structure stack applications.
Expressionconversation
- 表达式转换，中缀表达式变后缀表达式并求值。有栈中内容变化说明。-Expression conversion infix postfix expression and the expression changes evaluated. There are changes in the contents of the stack instructions.
VB-ReversePoland
- 自己用VB写的逆波兰表达式算法，包括中缀表达式转换到后缀表达式，后缀表达式的计算，在模块reversePoland.bas中，都已经写成了函数。-This code source written with visual basic is a realization of reversepoland algorithm.The transformation to suffix expression is expected in the file reversePoland.bas. In addt
ProExpr
- 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
Calculator
- c++语言编写的计算器程序，可以实现加减乘除，不过不支持双位数，使用堆栈编写，含有中缀表达式到后缀表达式的转换。-c++ language calculator program, Math can be achieved, but does not support double-digit, use the stack preparation, with infix expression to postfix expression converter.
PPT4
- 编写程序实现将中缀算术表达式转为后缀表达式,并利用栈和后缀表达式计算表达式的值-Programming to achieve infix arithmetic expressions to postfix expressions, postfix expression using stack and calculate the value of the expression
DataStruct_expresion
- 实现把原表达式分别用中缀,后缀,前缀三个形式表达,并分别求值-Were used to achieve the original expression infix, suffix, prefix the three forms of expression, and were evaluated
tryex2
- 中缀表达式转后缀。1位数值的后缀表达式计算。-Infix expression change suffix. A numerical calculation of the suffix expressions.