A new way is described via a linked records structure of establishing the precedence order among relations given by an acyclic digraph with Boolean and or or gates at some vertices. The proposed algorithm is illustrated by an application to a modular instruction system, and contrasted with ISM.