The space operator (implicit edge operator) is replaced to either:

1. if the produces nodes between the operator belong to the same scale: create a successor edge (as in an rgg producer).
2. otherwise: produced nodes are implicitly “grouped” by scale, and all nodes of the group on the right are connected with refinement edges to the last node of the left group.

module A;
module B;
module C;
module D;
 
protected void init ()
[
    Axiom ==> A;
    @256; TypeAxiom ==> {# A D #} /> {# B C #}; // the type graph contain the scale relationships
    // at the end of the init, the main graph contain one A node
]
public void r()[
    A ==> D A B C; // all produced nodes are separated with the same operator but they are connected by edge depending on their scale;
]

This produce the graph: