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.