Crucial for this is the DrawTree module that draws trees in accordance with the conventions Seuren uses in his papers. SAs are formulated in a higher order Predicate Calculus, according to a small set of context-free Formation Rules and a Lexicon. SA-trees have simple branchings and deep embeddings. The Transformation Rules fall into two classes, those of the Cycle, and those of the Postcycle. The largely structure-driven postcyclic rules apply in linear order as defined by the grammar.
Morphology is largely, and phonology totally, left out of account.
It moreover appears that language-specific differences amount largely to different postcyclic rule orderings, to different parameter settings in otherwise identical rules, to different lexical inductions of cyclic rules, or to different positions in the formation rules. When more grammars of different languages are available a parametrization of the general theory should be feasible. They are, moreover, to some extent semantically redundant. They are redundant in so far as scope sometimes has to be assigned where it is semantically irrelevant. For the grammar to work, adverbials and the tenses, for example, require precise scope assignments with respect to each other.