搜索资源列表
libbitap
- wu-manber算法的实现。 Wu-Manber基于BM算法思想，通过SHIFT、HASH、PREFIX三张表进行快速跳跃，实现快速多模式匹配。-A clean implementation of Sun Wu and Udi Manber s bitap algorithm. Note that the complete search string must be matched by the pattern. If you want to search for subst
Assignment-2-final
- conversion between infix, prefix and postfix
biaodashiqiuzhi
- 通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value.
main
- 把输入的前缀表达式转换为后缀表达式并输出-Prefix of the input expression into postfix expression and output
ProExpr
- 实现表达式求值，表达式树绘制，前缀表达式转换中缀表达式，中缀表达式转换后缀表达式-To achieve expression evaluation, expression tree drawing, prefix expression conversion infix expression, the expression postfix conversion infix expression
Expression-evaluation(suffix-method)
- 在栈的思想下，利用后缀表达式解决表达式求值的问题。类似的，可以推广到前缀表达式求值。-Thinking in the stack, using postfix expression evaluation expression to solve the problem. Similarly, the prefix can be extended to expression evaluation.
src
- This program takes an equation in prefix,infix, or postfix mode with proper parenthesis and parses the equation into a binary tree to show which equations come first, then outputs the same equation back in prefix,infix, and postfix notation.
post_to_pre
- 将后缀表达式转换成前缀表达式：从键盘读入一后缀表达式，转化成前缀式-Prefix to postfix expression into the expression: read from the keyboard into a postfix expression, converted into a prefix-style
Calculator
- 模仿实现windows下的计算器基本功能，并可以将前缀表达式转化为后缀表达式的功能。-Imitation to achieve the basic functions of the calculator under windows, and the expression can be converted into postfix expression prefix function.
PRE_POST
- program in c to implement prefix to postfix
1
- 输入表达式 建立二叉树 通过周游 输出 中缀后缀前缀表达式-Enter the expression to establish a binary tree output by traveling prefix infix postfix expression
shuzhizhuanhuan
- 表达式是数据运算的基本形式。人们的书写习惯是中缀式，如：11+22*(7-4)/3。中缀式的计算按运算符的优先级及括号优先的原则，相同级别从左到右进行计算。表达式还有后缀式（如：22 7 4 - * 3 / 11 +）和前缀式（如：+ 11 / * 22 – 7 4 3）。后缀表达式和前缀表达式中没有括号，给计算带来方便。如后缀式计算时按运算符出现的先后进行计算。本设计的主要任务是进行表达式形式的转换及不同形式的表达式计算。-Expression is the basic form of dat
infix_translation
- infix to postfix prefix
infix_lab
- converting infix to postfix and prefix-converting infix to postfix and prefix
text2
- 实现了用树建立数值表达式，并求其值，随便输出它的广义表、前缀表达式和后缀表达式-To realize the tree is to develop a numerical expression, and for its value, literally output its generalized list, prefix and postfix expression expression
Project-Diva-4
- 课程作业, 将输入的前缀表达式转换为对应的逆波兰表达式(后缀表达式)-Course work, the prefix expression is converted to the corresponding input Reverse Polish Notation (postfix expression)
Convert Prefix To Postfix Expression
- Convert Prefix To Postfix Expression
e
- 按常规形式输入算术表达式（例如：输入2*(6-4)+8/4），要求能够： （1）生成表达式的后缀表示，并输出； （2）生成表达式的前缀表示，并输出； （3）基于表达式的后缀表示，对该表达式求值； （4）编写一个主程序对表达式求值函数进行测试。 -Enter a conventional form of arithmetic expressions (for example: Input 2* (6-4)+8/4), requires the ability to: (1) t
Postfix
- 将前缀码转换为普通码并求值 -The prefix code is converted to common code and uated
traverse-postfix-to-prefix
- To create a expression tree and traverse postfix to prefix and infix.