Example for Form Logic 
Example for Form Logic
The diagram below shows the tree structure of the root node Pages and windows:
The numbering of the nodes also shows the sequence in which they are processed (from top to bottom). The first node is the root node. The successors of a node are all nodes included directly under this node in the hierarchy. For node 5 these are the nodes 6 to 9 (direct successors are only the nodes of the next hierarchy level, that is 6, 7, and 9).
A node without a successor node is also called end node. Elementary nodes can never have successors (see also
Node Types: Overview). If the condition of node 7 is false, neither node 7 nor node 8 are processed. Processing resumes directly with node 9.
In this example, we assume that no pages are called dynamically and that there is enough space on the page for the output.