Non-Hierarchical Composite Words

Example 8-10 shows a non-hierarchical composite word, word12, which is a composite of words word10 and word11. This example works assuming that all specified bits are not specified as 1 in the initial marking bits. Functionally, with this encoding, if word11 is added to a label with word10 already present (or vice verse), word12 is automatically added to the label. Non-hierarchical composite words must always preceed the words of which they are composite. Note that a combination constraint cannot prevent a non-hierarchical composite word from being combined with a word of which it is a composite.

Example 8-10 Non-Hierarchical Composite Word

name= word12;  markings= 6 7;
name= word10;  markings= 0 6;
name= word11;  markings= 1 7;