搜索资源列表
infix_prefix
- lisp编的算术表达式中缀转后缀程序，递归。-lisp series of the arithmetic expressions grade switch suffix procedures, recursive.
calcinfix
- 以前自己做的小程序，用于避免计算器冗长的输入时出错； 实现方法： 传统的中缀转后缀的方法-before doing small procedures for avoiding lengthy calculator input errors; Method : traditional Chinese grade to the suffix
client_ocx
- 一个ATL实现的自注册ActiveX控件，可以嵌入网页(vc＋＋ 7.0) 实现方法： 传统的中缀转后缀的方法-an ATL registered since the ActiveX controls can be embedded website (vc + + 7.0) method : traditional Chinese grade to the suffix
Cshartcomputer20080706
- csharp写的计算器,用数据结构的方式写,中缀转后缀,后缀计算
calculator
- 表达式计算器，实现+,-，*，/,中缀转后缀-calculator
pp
- 中缀转后缀求值算法 有判断的代码部分-Infix to suffix evaluation algorithm has to determine the code part
cpp..
- 转化实现中缀转后缀 判断表达式的输入 VC6.0环境-Transformation to achieve infix expression to determine the input suffix VC6.0 environment
biaodashijisuan
- 表达式计算，用栈实现，可实现中缀转后缀，表达式值的计算等功能-Expression, the use of the stack to achieve, can be achieved in up to suffix, expression value calculation and other functions
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.
Stack
- 栈的定义，C++定义的栈的基本操作 用于栈的操作练习 表达式求值，中缀转后缀-Stack
ExpressionTest
- 中缀表达式转后缀表达式基本思路是：用一个链表 List 储存将要生成的后缀表达式；用一个栈 Stack 储存操作符；判断当前节点， 如果是操作数， 直接加入后缀表达式中， 如果是操作符，则比较前一个操作符和当前操作符的优先级…… -Infix expression basic idea is to switch to postfix expression: list List with a store that will be generated by postfix expression
1
- 实现中缀转后缀的功能，里面包括了符号的匹配-Infix suffix to achieve transfer functions, which includes the matching symbol
stack
- 使用堆栈写的表达式中缀转后缀，并且计算表达式的值，可支持多位数和四则运算。-Written expression using stack switch infix suffix, and the calculated value of the expression, can support more than the median and arithmetic.
jisuanji
- 数据结构作业（用栈结构实现计算器的中缀转后缀表达）-Data structure operations (with the stack structure to achieve change suffix calculator infix expression)
shiyan
- 中缀转后缀并进行简单加减乘除。利用栈的操作。-Infix and suffix for simple transfer Math. Use of stack operation.
Infix-to-postfix
- 中缀转后缀表达式，编译原理实验。 递归下降分析法实现。-Infix to postfix expression, the compiler of principle experiment. Recursive descent analysis.
CCshhartcompuS
- csharp写的计算器，用数据结结构的方式写，中缀转后缀，后缀计算 -csharp write calculator, write the data node structure, infix to suffix suffix calculation
bool-value
- 求给定布尔表达式的真值,包括中缀转后缀，由后缀求值的运算。-Demand given the true value of the Boolean expression, including infix to suffix the suffix for the value of the operation.
中缀转后缀
- 数据结构课程练习：中缀输入，转换为后缀输出(The practice of data structure course: input infix to postfix output.)