On arithmetic expressions and trees
Communications of the ACM
One-Pass compilation of arithmetic expressions for a parallel processor
Communications of the ACM
On compiling algorithms for arithmetic expressions
Communications of the ACM
Expression optimization using unary complement operators
Proceedings of a symposium on Compiler optimization
Algol-60 Implementation
| Hi-index | 0.00 |
The classical Reverse Polish Algorithm is examined to see why it does not produce optimal evaluation order Reverse Polish. A new algorithm, the Switching Reverse Polish Algorithm, is derived which optimises or improves the evaluation order but retains the simplicity and serial input-output of the classical algorithm. The supermultiply operator is introduced to facilitate strength reduction.