流水线计算机上表达式的并行处理

Parallel Processing of Expression on Pipeline Computer

本文举例说明对分法不能构造出一般表达式的最低分析树,给出利用交换律和结合律构造表达式最低分析树的算法并予以证明。该算法适用于诸如Fortran程序设计语言,可提高程序中不可向量化部分的目标代码质量。

In this paper an example is given to illustrate that dichotomizing can't construct the shortest parsing tree of expression. An algorithm to construct the shortest parsing tree of expression using commutative and associative laws is given and proved. The algorithm is suitable for programming languages like Fortran. It can raise the quality of object code of the program being unable to be vectorized.