搜索资源列表
infixtopostfix
- infix to postfix program,.
INFXPOST
- programm that convert infix term to postfix
posttoin
- postfix to infix converter
zhongzhuizhuanhouzhui
- 中缀表达式转后缀表达式，数据结构中堆栈的应用。-Switch to postfix infix notation expressions, the data structure stack applications.
exchange_perfix
- 中缀表达式 后缀表达式：不包含括号，运算符放在两个运算对象的后面，所有的计算按运算符出现的顺序，严格从左向右进行-Infix expression postfix expression: does not contain parentheses, operator on two operands in the back, all the calculations appear in the order according to operator, strictly from left to ri
stack_and_queue
- 以字符序列的形式从终端输入语法正确的、不含变量的整数表达式，利用给定的算符优先关系把中缀表达式转换成计算机容易处理的后缀表达式。本实验中操作数规定为1位数字字符，运算符只有+、-、*、/。-In the form of a sequence of characters entered from the terminal grammatically correct, non-integer variable expression, using the given operator preceden
src
- Java版运算表达式解析器 主要功能: 对有括号的四则运算解析并求解. 支持多种表达式类型 思路: 1.把中缀表达式转化成后缀表达式 2.从后缀表达式得到解 注意: 该版本只支持1.6JDK,如果想替换成1.5JDK改替换LinkedList的几个方法就行了. 详细内容: http://jomper.javaeye.com/blog/464906-Java version of computing expressions parser mai
Infix_expression_into_postfix_expression_calculati
- 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate
source
- 数据结构，线性表的应用（简单仓库管理）和栈的应用（中缀表达式转后缀表达式）-Data structures, application of linear forms (a simple warehouse management) and applications of stack (switch to postfix infix expression expression)
src
- This program takes an equation in prefix,infix, or postfix mode with proper parenthesis and parses the equation into a binary tree to show which equations come first, then outputs the same equation back in prefix,infix, and postfix notation.
main
- 表达式求值*** 将中缀表达式转换为后缀表达式。假设输入的算法表达式的运算符只有“＋、－、×、/、（、）”这几种。 要求：用栈完成；首先要判断输入的表达式括号是否配对，在正确表达式的基础上转换为后缀表达式，然后计算结果。 -*** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expressio
change
- 把中缀表达式转化为后缀表达式…… 第一行为T，表示有T组数据； 以下T行每行包含一个字符串，是中缀表达式。 对于每组测试数据数据后缀表达式。-Infix expression to postfix expression into the first act ... ... T, says there are T sets of data the following T lines each line contains a string, is the infix expres
postfix
- 用Stack类来实现中缀表达式转化为后缀表达式，并且根据后缀表达式求值-With the Stack class to implement an infix expression into postfix expression, and expression evaluation according to the suffix
convert
- 实现数据结构中中缀表达式转换为后缀表达式的功能-Data structure is converted to postfix infix expression function expression
edelweiss
- 2-9进制的数字转换 中缀表达式转换为后缀表达式 字符串中字母的频率及排序 括号配对的验证 链表式储存及功能-2-9 band of the digital conversion infix expression into postfix expression string and sort the letters in parentheses matching the frequency of verification of storage and features list
main
- 中缀转换成后缀表达式有很多运用，例如可以用来构造查询表达式。本程序实现了中缀转换成后缀的算法-Infix expression into postfix to use a lot, for example, can be used to construct a query expression. Realized by the infix into postfix algorithm
MyCalculator
- 实现中缀表达式转后缀表达式 能进行+，-，*，/，（）的运算的计算器 使用数据结构堆栈-Switch to postfix infix expression to achieve expression Computing can be+,-,*,/,() calculator Stack data structure using
CPP_ExpressionConvert
- 利用栈实现表达式转换（中缀到后缀）并求值-Stack expressions conversion (infix to postfix) and evaluated
infixpostfix.c
- infix to postfix conversion code.
InfixToPostfix
- Infix to postfix conversion in VB.net