搜索资源列表
CalculatorProject
- 这是我仿照WINDOWS下的计算器而做的，计算处理用逆波兰式，现在还只能进行十进制的计算，其他还没有实现被我屏蔽了。-modeled on the Windows calculator and do the calculations using inverse Polish, now only for the metric system, the other has not been realized I was a shield.
safasfds
- 同学的一个java 程序， 是我们的作业 包括三元试和四元试和逆波兰试-students a java process, our operations include three yuan and four yuan test test test and inverse Poland
nibolan
- java语言实现表达式的逆波兰变换，逆波兰式算法主要的设计思路是把一般的中序表达式变为右序表达式
JAVA
- 输入一个表达式，转换为逆波兰式，三元式和四元式
StringCalcGUI
- 比较简单的一个java写的表达式计算器。核心算法为经典的中缀转逆波兰算法。用了正则表达式进行合法性检查。新人刚学java，写的不好的地方请指正，谢谢！-Relatively simple to write a java expression evaluator. The core algorithm classic infix turn Reverse Polish algorithm. Use regular expressions to check the legality. Newcome
Formula
- JS用来解析公式表达式的代码，并使用逆波兰表达式实现运算符的堆栈-JS formula expression used to parse the code and use Reverse Polish Notation implement operator stack
RPN
- 实现逆波兰表达式的转换和计算，中缀转后缀-Achieve Reverse Polish Notation conversion and calculation, infix turn suffix
Calculator
- JAVA编写的简单计算器 逆波兰式的实现 JAVA课程的作业-Write a program that reads an expression as input and print out the result. Only integers and operators below are allowed in the expression: +-*/ ( ) Your program should be able to deal with multip
calculator_logic_547101201
- 对输入合式公式（例如P->Q）并能转化为波兰式（->PQ）和逆波兰式（PQ->），程序简单、操作容易，是个练手的小程序-The input formed formulas (such as P-> Q) and can be converted into Polish (-> PQ) and Reverse Polish Notation (PQ-> ), the program is simple, easy to operate, is a small pr
orgsix
- 逆波兰表达——不再需要括号，机器可以用递归的方法很方便地求解。-Reverse Polish expression- no longer need braces, the machine can be easily solved by using recursive method.
RegularGrammar
- 1、正规文法和正规表达式相关功能的实现 1）允许用户输入一左线性或右线性文法（至少4条产生式），将其转换为右线性或左线性文法 2）若用户输入的文法不是3型文法，则给出出错提示 3）显示出该文法对应的DFA 4）显示出该正规文法对应的正规表达式 2、中间语言相关功能的实现 1）允许用户输入一赋值表达式，将该赋值表达式分别转换成逆波兰表示、三元式-Implement regular grammar and regular expressions related functio
kfpsf3
- Java写的泥波兰式 A栈中存放的是逆波兰式结果, B栈中存放的是操作符 B栈初始状态为-Java write mud polish style is stored in A stack of reverse polish type as A result, the B operator B is stored in stack for the initial state
EHNYPQJ64
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要,-Java binary tree traversal follow-up Java binary tree traversal is mainly used in the aftermath of the inverse solution of the polish style, is very important in the compilation,
69555898
- Java写的泥波兰式 A栈中存放的是逆波兰式结果, B栈中存放的是操作符 B栈初始状态为-Java write mud polish style is stored in A stack of reverse polish type as A result, the B operator B is stored in stack for the initial state
Polish2
- 数据结构实验，逆波兰表达式，C++编程实现(Data structure experiment, inverse Polish expression, C ++ programming realization)
jAVA
- 无符号数的词法分析与逆波兰数的词法分析JAVA代码(The number of unsigned lexical analysis)
secrhr
- Java写的泥波兰式 A栈中存放的是逆波兰式结果, B栈中存放的是操作符 B栈初始状态为()