Generalization of both of these analyses leads to operator grammar, in which each sentence is derived in a uniform way as a partial ordering of the originally simple words which enter into it: Each step (least upper bound) of the partial ordering (of a word requiring another) forms a sentence which is a component of the sentence being analyzed.