1 strict digraph { 2 graph [ordering=out] 3 4 d [shape=box,label=LocalVariableDeclaration] 5 m [shape=box,label=Modifiers] 6 t [shape=box,label=PrimitiveTypeTree] 7 l [shape=box,label=Literal] 8 e1 [shape=plaintext,label="",width=0.125] 9 e2 [shape=plaintext,label="",width=0.125] 10 int [shape=plaintext,width=0.125] 11 i [shape=plaintext,constraint=false,width=0.125] 12 b1 [shape=plaintext,label="_",width=0.125] 13 b2 [shape=plaintext,label="_",constraint=false,width=0.125] 14 b3 [shape=plaintext,label="_",constraint=false,width=0.125] 15 q [shape=plaintext,label="=",constraint=false,width=0.125] 16 z [shape=plaintext,label="0",width=0.125] 17 y [shape=plaintext,label="[...]",width=0.125] 18 19 subgraph {rank=same;int;b1;i;b2;q;b3;z;y} 20 21 d -> m 22 m -> e1 23 m -> e2 [style=dashed] 24 d -> t 25 t -> int 26 t -> b1 [style=dashed] 27 d -> i 28 d -> b2 [style=dashed] 29 d -> q 30 d -> b3 [style=dashed] 31 d -> l 32 l -> z 33 l -> y [style=dashed] 34 } 35
