用布尔矩阵求解算符优先表算法的改进

算符文法的算符优先表可以用布尔矩阵理论求解，传统的算法在文法的全部符号集合上定义各类关系，导致布尔矩阵规模较大。对算法进行了改进，将文法符号划分为终结符集合与非终结符集合2个子集，在子集之间定义关系，可降低布尔矩阵规模，提高运算效率。

Improvement on Boolean Matrix Algorithm for Solving Operator Prior Table

The operator prior table of an operator grammar can be solved by Boolean matrix theory. Usually, the relations used were defined on a set of all grammar characters and yield a series great scale Boolean matrices. An improvement on Boolean matrix algorithm for solving operator prior table is put forward. It can be done by parting grammar characters into two blocks, e.g, terminal characters set and non-terminal characters set, all relations used are redefined between subsets, the scale of each Boolean matrix is reduced and the efficiency of computing increased significantly.