搜索资源列表
khss
- 数据结构:带括号的算术表达式求值。能完成一位数的带括号的算术表达式的运算,结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-data structure : the bracketed arithmetic expression is evaluated. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack I
计03_6_27张石
- 中缀表达式向后缀表达式的转化,并且具有求值的功能,有出错显示.-expression which is made up of the suffix to the conversion formula, and has evaluates the function, wrong show.
SmartCounter
- 此程序实现了表达式求值,算法先将用户输入的中缀式转换为后缀式,再求表达式的值,并且可以自定义变量。此程序为VC6下的控制台程序,有兴趣的朋友可以为起添加一个GUI-this program evaluates the expression, the algorithm first user input which is made up of the conversion to type suffix. try the value of the expression, and can define
zhan-op
- 栈的操作与应用 定界符配对检查 中缀转后缀并求值-stack operation and application delimiter matching inspection superintendent to seek value and Suffix
biaodashileixing
- 对输入的前缀,后缀等表达式识别,检查,求值等 1.以字符序列的形式输入语法正确的前缀表示式并构造表达式。 2.用带括号的中缀表示式输出表达式。 3.实现对变量的赋值,变量的初值为0。 4.对算术表达式求值。 5.构造一个新的表达式。 -of input prefixes, and suffixes expression identification, inspection, for a value. a sequence of characters in the form
Untitled1
- 将中缀表达式转化为后缀表达式并求值,输出后缀表达式及值
biaodashiqiuzhi
- 实现了表达式的求值。当你输入一般的表达式,程序会实现了转化为前缀表达式,中缀表达式以及后缀表达式,并分别计算出结果。
expression
- 表达式求值:利用栈操作实现由中缀表达式到后缀表达式的转换,再求值.
中缀比表达式变后缀表达式再求值
- 此是 数据结构的课程中的一个经典的算法 -this is the data structure of the curriculum of a classical algorithm
expression
- 用C语言版 编写一个表达式求值演算的 算法程序 要求:使用栈,需要将算法的过程显示出来 ,输入一连串算术值 如:2*(3+2)# 然后 显示出算术过程 和结果!先将输入的中缀 转换后缀 再求值 程序中使用两个栈! 可以在VC++ 中运行- A linear epitope recognized by both MAbs,c2410 and WH303,which has strong specificity of CSFV,has been precisely defined and l
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
houzhui
- 中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement
Stack
- 栈的定义,C++定义的栈的基本操作 用于栈的操作练习 表达式求值,中缀转后缀-Stack
expressions
- 数据结构线性表的应用,算术表达式求值,中缀转后缀算法,加减乘除基本运算-The application of the linear table data structure, arithmetic expression evaluation, infix suffix transfer algorithm, the basic operations addition and subtraction multiplication and division
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