搜索资源列表
aa
- 简单的一遍编译器输入中缀表达式输出后缀表达式-Again a simple compiler input infix expression output suffix expressions
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
infixcaculator
- 根据用户输入的中缀表达式，将其转化为后缀表达式并求值。-Based on user input infix expression into a suffix of its expression and evaluated.
Expression
- 把中缀表达式转换为后缀表达后，求表达式的结果。用到栈和队列-Infix expression to convert the expression of suffix, and the results of expressions. Used stack and queue
convert
- 将由数字和四则运算符组成的后缀表达式变换为中缀表达式。输入的后缀表达式包含的运算符不超过15个。要求转换后的中缀表达式中不应出现不必要的括号。例如，整个表达式两端的括号要省略，不影响原计算顺序的括号要省略。-Will be 4 numbers and the composition of the suffix operator expressions transform infix expression to. Enter the suffix operator expression does
ExpressionCalculatorinfixexpression
- 表达式计算器（中缀表达式），利用数据结构课程中的算法设计而成，欢迎使用！-Expression Calculator (infix expression)
Expressionconversation
- 表达式转换，中缀表达式变后缀表达式并求值。有栈中内容变化说明。-Expression conversion infix postfix expression and the expression changes evaluated. There are changes in the contents of the stack instructions.
zhongzhui
- 本程序能将运算式从中缀表达式转换为后缀表达式，并计算运算式的值。暂时仅可计算正整数之间的运算。暂时无法处理负数，要计算负数请用 (0-n) 的形式。输入仅含数字0~9及+、-、*、/、(、)的式子，并在结尾处加 # 字作为结束符。-This program can convert an expression from infix expressions to postfix expressions, and calculate the expression value. Calculate th
zhongzhui
- 中缀表达式，可以将中缀转换为后缀，并且计算四则运算式-zhongzhui
Infix_expression
- 编写一程序直接计算任意输入的中缀表达式的值，且不能采用先转换到后缀表达式再计算的方式。-Procedures for the preparation of a direct calculation of arbitrary input infix expression values, and can not be converted to a postfix expression using the first re-calculated way.
exchange
- （1）实现中缀表达式转换成后缀表达式 （2）计算表达式的值 -(1) implementation infix expression into postfix expression (2) Calculate the value of the expression
calculator
- 计算器，用两个栈实现中缀表达式的直接计算。-calculator, use two stacks to implement .
Expressionevaluation
- 表达式求值，有后缀表达式求值，中缀表达式直接求值，和中缀表达式间接求值-Expression evaluation, expression evaluation have the suffix, infix expression evaluation directly and indirectly infix expression evaluation
suffix
- 实现中缀表达式到后缀表达式的转换，并求值-Midfix turn to suffix and solve it
calculator2
- 用C++编写的一个简单计算器，可以实现将中缀表达式转化为后缀表达式，并计算输出表达式的值，利用了STL中的栈-using C++ make a calculator which can used to make middle pression into fix pression and calculate the value
transform-nifix-expression-to-postfix-expression-w
- 利用栈将四则运算的中缀表达式（仅限于整数）转化为后缀表达式-Using the stack to transform four operations nifix expression (only integers) into postfix expression
KESHE
- 数据结构课程设计 中缀表达式求解（谁帮忙改一下撒，有错误）-Data structure for solving curriculum design in the infix expression (who help change it spread, there is an error)
expression
- 实验要求把中缀表达式转换成为后缀表达式，然后再对后缀表达式求值。其中要利用栈，数组等。-Experimental requirements to convert infix expression into postfix expression and then evaluate the expression of the suffix. Which make use of the stack, the array and so on.
abstractstack
- 给定一个中缀表达式，要求转化为后缀表达式，并且生成抽象堆栈机的代码，完整代码加实验报告。-Given an infix expression into postfix expression requirements, and generate an abstract stack machine code, complete code and test reports.
PostTest
- 将给定的中缀表达式转化成后缀表达式,利用栈, 将运算符不断的相比较其优先级来进行表达式的生成(Given the infix expression into postfix expression)