搜索资源列表
infix-Postfix
- 利用堆栈进行表达式的 Infix -> postfix 转换 适合大专院校计算机专业数据结构课参考 用法： 输入infix表达式为：(3+2*3)^2 则 转换位postfix表达式 323*+2^ 进而可以计算出表达式的值为81 目前bug: 主要作原理演示用，只能处理1位数字变量，且变量值不可太大-use of the stack for expression Infix -
Caluate
- 将中缀表达式转换为后缀表达式，并计算任意四则运算表达式的结果，采用链表和队列实现，非文法和状态机-Infix expression would be converted to suffix expressions, and calculate the arithmetic expression of arbitrary results, the use of linked lists and queues to achieve, non-grammar and the state machine
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
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
infixToprefix
- This source code is used for make infix expression from prefix expression by using assembly and C language together.
Postfix
- Convert infix to postfix
InfixToPostfix
- Infix到Postfix转化的完全实现，Infix到Postfix转化的完全实现-Infix to Postfix conversion fully achieved
infixtopostfix
- infix to postfix program,.
postfix
- implementation of infix to postfix algorithm
InfixToPostfix
- infix to postfix expression
posttoin
- postfix to infix converter
main
- 实现将一个表达式转成前缀，中缀和后缀的3种形式，并计算表达式的值，其中数字为浮点型-Achieve an expression is converted into prefix, infix, and suffix of the three kinds of forms, and calculate the value of the expression, in which figures are floating-point type
Assignment-2-final
- conversion between infix, prefix and postfix
zhongzhuizhuanhouzhui
- 中缀表达式转后缀表达式，数据结构中堆栈的应用。-Switch to postfix infix notation expressions, the data structure stack applications.
SOURCE
- convert infix expression to post fix expression and evaluate post fix expression
biaodashiqiuzhi
- 通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value.
src
- Java版运算表达式解析器 主要功能: 对有括号的四则运算解析并求解. 支持多种表达式类型 思路: 1.把中缀表达式转化成后缀表达式 2.从后缀表达式得到解 注意: 该版本只支持1.6JDK,如果想替换成1.5JDK改替换LinkedList的几个方法就行了. 详细内容: http://jomper.javaeye.com/blog/464906-Java version of computing expressions parser mai
Expr
- 对数据结构中二叉树的理解，前缀、中缀、后缀的相互转换.-Binary tree data structure understanding, prefix, infix, suffix interchangeable.
InfixtoPostfix
- Converts Infix expression to postfix expression
Infix
- date structure infix-applet