Return to article
Figure 1. Illustration of the underlying binary tree structures for the various expressions used in the (a) hierarchical syntactic condition, and (b) list (non-hierarchical) condition.

The grammatical/generative part of the syntax starts with an alphabet, out of which termini and formulae are (recursively) built, thereby yielding arbitrary hierarchical expressions. For assumed processing steps see (Supplemental Information: Figure S1).