Home → Magazine Archive → June 1972 (Vol. 15, No. 6) → A Boolean matrix method for the computation of linear... → Abstract

A Boolean matrix method for the computation of linear precedence functions

By David F. Martin

Communications of the ACM, Vol. 15 No. 6, Pages 448-454
10.1145/361405.361413



A modified version of Bell's Boolean matrix method for the computation of linear precedence functions associated with a conflict-free matrix of precedence relations is given. This algorithm not only detects when the precedence functions do not exist, but also provides an indication of why they do not exist, so that corrective action can be taken if possible. Necessary and sufficient conditions for the existence of precedence functions are given. The use of Boolean matrices to prove the existence of precedence functions associated with classes of conflict-free grammars is illustrated through an example.

The full text of this article is premium content

0 Comments

No entries found