搜索资源列表
EvaluateExpression 算术表达式求值
- 算术表达式求值： 中缀表达式求值； 将中缀转换成后缀表达式并求值-Arithmetic expression evaluation: infix expression evaluation to infix into postfix expression and evaluates
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
postcalc
- solves infix expressions changes them to postfix then solves them
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
InfixtoPostfix
- Converts Infix expression to postfix expression
Infix_expression_into_postfix_expression_calculati
- 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate
infixpostfix
- Infix to Postfix translator
InToPost
- INfix to postfix implementation in java-INfix to postfix implementation in java
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
Ipprarn
- 中缀转后缀求值算法 有判判断的代码部分 -Infix to postfix evaluation algorithm sentenced to judgment part of the code
infix_lab
- converting infix to postfix and prefix-converting infix to postfix and prefix
CPP_ExpressionConvert
- 利用栈实现表达式转换（中缀到后缀）并求值-Stack expressions conversion (infix to postfix) and evaluated
infixpostfix.c
- infix to postfix conversion code.
infix2postfix
- 它是一個關於方程的acm問題。 當用戶輸入信息例如（3 + 2）* 5時，程序將輸出後綴格式。 因此，該程序將中綴轉換為後綴表達式。 這個程序也被系統接受-It is a question of acm equation. When the user enters information such as (3+ 2)* 5, the program will output format suffix. Therefore, the program will convert infix to po
InfixToPostfix
- Infix to postfix conversion in VB.net
infix_postfix
- c program to convert infix to postfix