"Documentation by paper"

[Robert Dewar]

> Almost all the differences in the standard compiler terms (for example,
> dominators) that have been mentioned in this discussion, or that I have
> observed, are the difference between < and <= : a partial order relation
> is defined, and some texts use the < form and others use the <= form.
> The texts that use the <= definition usually then use some adjective like
> "strict" or "proper" to get the corresponding < definition.

The definition of basic blocks also varies somewhat. CS in general
suffers from a lack of absolutely well defined terminology, both for
data structures and for algorithms (for instance for some people quicksort
inherently includes the in place exchange algorithm, for others the
essence is only the arbitrary division, and the exchange is a data
structure detail). It never does any harm to define terms :-)