A Note on Computing Precedence Functions
M. C. Er · The Computer Journal · 1982
An algorithm for computing the precedence functions of a given precedence matrix is presented. This algorithm is based on the parallel traversal of digraph representing the precedence matrix. It applies equally well to the computation of both simple precedence and operator precedence functions. Furthermore, it has pedagogical value in explaining the concept of longest path in the digraph context.