搜索资源列表
data-structure
- 在学习数据结构时完成的几个小的编程练习，大家可以参考参考，分别是中缀转后缀表达式，约瑟夫问题，一元多项式相乘-Upon completion of the study data structure of several small programming exercises, you can refer to the reference, which are in turn postfix infix expression, Joseph problems, one yuan polynomia
android
- Android 计算器源码之逆波兰算法 基于Android 4.2.2 做的一个简易计算器，采用逆波兰算法，将中缀表达式转换为后缀表达式，可解析带括号的四则运算-Based on the Android 4.2.2 do a simple calculator, using the algorithm of reverse polish, convert infix expressions to postfix expression, can parse arithmetic with pa
sizeyunsuan
- 四则运算表达式求值，将四则运算表达式用中缀表达式，然后转换为后缀表达式，并计算结果。-Four arithmetic expression uation, the four arithmetic expressions used in infix expression, and then converted to a postfix expression, and calculate the results.
Calculator
- 一个简单的计算复杂表达式的值，利用栈，将中缀表达式转化为后缀表达式-A simple calculation of the value of complex expressions, the use of the stack, the infix expressions into postfix notation
nifix-expression
- 将中缀表达式转换成后缀表达式，开发环境为Visual C-Convert infix expressions into postfix expression, in Visual C++
Simple-calculator
- 通过算法把中缀表达式转化为后缀表达式并计算出所需要的公式结果-The algorithm takes the infix expression into postfix expression and calculate the required formula results
postfix-notation
- 1、给出文法如下： G[E] E->T|E+T T->F|T*F F->i(E) 对应的转化为逆波兰式的语义动作如下： E-> E(1)op E(2) {E.CODE:= E(1).CODE||E(2).CODE||op} E->(E(1)) { E.CODE := E(1).CODE} E->id { E.CODE := id} 2、利用实验5中的算符优先分析算法，结合上面给出的语义动作实现逆波兰式的构造
expression-evaluate
- 将中缀表达式转换成后缀表达式，再将后缀表达式求值-Convert infix expression into postfix notation, then postfix expression uation
biaodashiqiuzhi
- 自己编写的堆栈，单链表实现，并用于表达式求值（中缀转后缀、后缀求值）-I have written a stack, single linked list implementation, and for expression uation (infix turn suffix, suffix uation)
infix_to_po
- 后缀转中缀的表达式，一样可以用的，需要的可以拿去-Suffix turn infix expression can be used as needed may take
sicily-online-judge
- 包括 sicily online judge 1149等部分题目，线性表，最小生成树，中缀转后缀并计算后缀表达式等。 -including sicily online judge/list/BST/postfix and infix
operation
- 用栈实现表达式求值，将中缀表达式转换成后缀表达式-Use the stack to uate the expression and convert the infix expression into a suffix expression
write_expjession
- 实现中缀变后缀表达式求值,用VC编写的,大家可以来看看,发表下意见也行,-Implement infix suffix expression uation, using VC to write, you can see, the opinion,
InFix2PostFixorPreFix
- 要求：构建一个表达式树，当输入中缀表达式时，输出并打印其前缀及后缀表达式 实现：构造一个标准的表达式树的类，它涵盖先序、中序、后序遍历操作，通过不同顺序的打印操作来实现转换操作；相对于使用栈来进行转换，免去了中缀转成前缀时进行的逆序操作(Requirements: to construct an expression tree, when the input infix expression, output and print the prefix and suffix expression