搜索资源列表
-
0下载：
语法分析正确后就可以求值了，求值时用到一个操作数堆栈和操作符堆栈，以及一个算符优先表（存储了运算符之间的优先关系），具体细节可以阅读源码。-syntax analysis is correct after it evaluates the value used for a number of operations and the operator stacks stack, and an operator priority list (stored Operators relations bet
-
-
0下载：
利用栈求解算术表达式的值，程序分为两种表达式，中缀式与后缀式，分别得用栈先入后出的特性，以及运算符的优先级比较，进行求解-use arithmetic to solve the value of the expression, procedures are divided into two expressions, and the sergeant-type suffix. Stack were starting after the first-in-the characteristics, a
-
-
0下载：
这是我的数据结构课程设计，1. 初始化两个空栈，一个是操作符栈，一个是操作数栈。2. 如果字符是操作数，将它压入操作数栈。 如果字符是个操作符，则和运算符栈顶的运算符比较优先权后作相应操作，优先技小泽压入栈，大于则将栈顶的运算符出栈，并将运算数栈顶的两个数出栈进行运算。等于，则弹出操作符。-This is my data structure of the curriculum design, 1. Initialize two empty stacks, one stack operator,
-
-
0下载：
10以内数的四则运算表达式求值。利用堆栈的后进先出实现当运算符优先级较低的时候对操作数和运算符的出栈进行运算。-10 less than the number four operator expression is evaluated. The use of LIFO stack to achieve when the operator when a lower priority on the operand and operator of a stack to carry out comput
-
-
0下载：
演示用算符优先法对中序算术表达式求值的过程。
程序执行的命令包括：
（1）构造两个空栈，数栈和运算符栈；（2）输入一个中序算术表达式，表达式中数字进入数栈，运算符进入运算符栈；（3）将从键盘上输入的运算符与运算符栈中的运算符进行优先级比较；（4）将运算结果再放入数栈中；（5）结束。
-Demonstration by operators in order of priority on the arithmetic expression evaluation process. Pro
-
-
0下载：
表达式求值，根据运算符的优先级构造两个堆栈并运算-Expression evaluation, in accordance with the priority operator stack both class structure and operation
-
-
0下载：
利用栈来求解表达式求值问题。用的是算数优先法，设置了两个栈：OPTR,用来寄存运算符；OPND,用以寄存操作数或运算结果。-Usage of the expression evaluation stack to solve the problem. Count method using a priority, set up two stacks: OPTR, for storage operator OPND, for the storage operand or operation resu
-
-
0下载：
算术表达式求值：置操作数栈为空栈，表达式起始以#为栈底元素，依次读入每个字符，若是操作符则进入OPND栈，运算符则进入OPTR栈的栈定运算符比较优先权后作相应操作，直到OPTR栈顶元素和当前读入字符为-Arithmetic expression evaluation: set stack operand stack is empty, the expression starting with# as the bottom of the stack element, followed by re
-
-
1下载：
用C++编写带括号的算术表达式求值，利用堆栈实现，采用算符优先数算法。-Written with C++ arithmetic expression in parentheses is evaluated using the stack implementation, the use of operator priority number algorithm.
-
-
0下载：
利用栈的特点求解表达式、、主要是根据各运算符的优先级进行运算-Solved using the characteristics of the stack expression is mainly based on the priority of each operator for operation
-
-
0下载：
用栈实现表达式求解，包括栈的基本操作及运算符优先级比较，运算等。-Stack to achieve the expression evaluator, including the basic operation of the stack and the operator priority computing.
-
-
0下载：
关于中缀运算符运算与后缀运算符运算算法与课本相同；
关于中缀转后缀采取数据直接赋值，运算符入栈等候操作（根据优先级）的方法
-About infix operators computing and computing algorithms and postfix operators textbooks same infix turn on suffix take data directly assignment operator stack awaiting operation (ac
-
-
1下载：
[问题描述]
表达式计算是实现程序设计语言的基本问题之一。也是栈的应用的一个典型例子。设计一个程序，演示用算符优先法或转换成后缀表达式方法对算术表达式进行求值的过程。
[基本要求]
以字符序列的形式从终端输入语法正确的、不含变量的整数表达式。利用中缀表达式向后缀表达式转换的方法，实现对算术四则混合运算表达式的求值。-Expression computing is to achieve one of the basic problems of program design langu
-
-
0下载：
表达式求值运算是实现程序设计语言的基本问题之一，也是栈应用的一个典型例子。设计并演示用算符优先级对算术表达式的求解过程-Expression uations are one of the basic problems in implementing programming languages and are a typical example of stack applications. Design and demonstrate the process of solving the ari
-
