搜索资源列表
21codes_del62755882442
- 将布尔表达式翻译成后缀式（即逆波兰式），中间有词法分析，语法分析及中间代码生成-Boolean expressions to be translated into the suffix - (reverse Polish), there is a lexical analysis, Grammatical analysis and intermediate code generator
SmartCounter
- 此程序实现了表达式求值，算法先将用户输入的中缀式转换为后缀式，再求表达式的值，并且可以自定义变量。此程序为VC6下的控制台程序，有兴趣的朋友可以为起添加一个GUI-this program evaluates the expression, the algorithm first user input which is made up of the conversion to type suffix. try the value of
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, aft
Calculator
- 简易计算器，可以连续输入计算式，然后输出结果。先把中缀式转换成后缀式然后计算。
zjdm
- 逆波兰式定义: 将运算对象写在前面，而把运算符号写在后面。用这种表示法表示的表达式也称做后缀式。逆波兰式的特点在于运算对象顺序不变，运算符号位置反映运算顺序。采用逆波兰式可以很好的表示简单算术表达式，其优点在于易于计算机处理表达式。
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, aft
21codes_del62755882442
- 将布尔表达式翻译成后缀式（即逆波兰式），中间有词法分析，语法分析及中间代码生成-Boolean expressions to be translated into the suffix- (reverse Polish), there is a lexical analysis, Grammatical analysis and intermediate code generator
SmartCounter
- 此程序实现了表达式求值，算法先将用户输入的中缀式转换为后缀式，再求表达式的值，并且可以自定义变量。此程序为VC6下的控制台程序，有兴趣的朋友可以为起添加一个GUI-this program evaluates the expression, the algorithm first user input which is made up of the conversion to type suffix. try the value of
FomulaStack
- 利用栈求解算术表达式的值，程序分为两种表达式，中缀式与后缀式，分别得用栈先入后出的特性，以及运算符的优先级比较，进行求解-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 f
Calculator
- 简易计算器，可以连续输入计算式，然后输出结果。先把中缀式转换成后缀式然后计算。
expression
- 算术表达式求值,数据结构课程设计,非常实用,适合学生-Arithmetic expression evaluation, data structure curriculum design, very practical and suitable for students
zjdm
- 逆波兰式定义: 将运算对象写在前面，而把运算符号写在后面。用这种表示法表示的表达式也称做后缀式。逆波兰式的特点在于运算对象顺序不变，运算符号位置反映运算顺序。采用逆波兰式可以很好的表示简单算术表达式，其优点在于易于计算机处理表达式。-Reverse Polish definition: The object EDITORIAL computing, and the operator symbols written on the back
3071102672_A
- 计算后缀表达式，先将中缀式转化为后缀式，在进行计算，有较高的效率-Suffix calculated expression, first in the up-type into a suffix-style, in terms of higher efficiency
stack
- 前缀式转后缀式 simplestack是一个接口 stack是栈 suanshu是一个转换的类-Suffix to the prefix-style-type simplestack is a interface stack is a stack suanshu is a conversion type
convert
- 后缀式转中缀式 将由数字和四则运算符组成的后缀表达式变换为中缀表达式。 输入的后缀表达式包含的运算符不超过15个。 要求转换后的中缀表达式中不应出现不必要的括号。例如， 整个表达式两端的括号要省略，不影响原计算顺序的括号要省 略。-Suffix-type switch-type will be made up of four numbers and the composition operator for su
Conversion
- 将中缀式转化为后缀式，以便化简算式的计算-Infix to suffix-style into a style, in order to simplify the calculation formula
1
- 实现中缀表达式转后缀表达式，并利用后缀表达式求值-Infix expression to expression algorithm suffix
InToPost
- 输入中缀式，转换为后缀式，并输出结果。如2+2*2，得出结果为6.-Input is made up of type, into a suffix-type, and output. Such as 2+2* 2, the results for the 6.
bianyiyuanli
- 词法扫描并生成中间表达式，理解中间代码，将非后缀式用来表示的算术表达式转换为用逆波兰式来表示的算术表达式 -Lexical scanning and generate intermediate expression, understanding of intermediate code will be used to indicate the non-suffix type is converted to the arithmet
中缀转后缀
- 栈的应用：在四则运算中序式转后续式的基础上，利用栈的帮助完成后序式的计算，并输出结果。(Application of stack: in the four operations, in order to follow up the follow-up, based on the help of the stack to complete the sequent calculation, and output the results.)