On arithmetic expressions and trees
- 1 February 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (2), 81-84
- https://doi.org/10.1145/362848.362859
Abstract
A description is given of how a tree representing the evaluation of an arithmetic expression can be drawn in such a way that the number of accumulators needed for the computation can be represented in a straightforward manner. This representation reduces the choice of the best order of computation to a specific problem under the theory of graphs. An algorithm to solve this problem is presented.Keywords
This publication has 1 reference indexed in Scilit:
- On compiling algorithms for arithmetic expressionsCommunications of the ACM, 1967