gentrex test page

On this page you can try out gentrex on a static tree. You are free to write expressions to explore the tree and use the map, considering:

expression:
user fields
 
nodetext
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
map nodes
 
mapnode (A..Z)print in result
an/a
bn/a
cn/a
dn/a
en/a
fn/a
gn/a
hn/a
in/a
jn/a
kn/a
ln/a
mn/a
nn/a
on/a
pn/a
qn/a
rn/a
sn/a
tn/a
un/a
vn/a
wn/a
xn/a
yn/a
zn/a

Expression:


# BFS search all leaf nodes
([] /* p=[]) && !(p . [])

Bytecode dump and result:
000  ENTER            
001  TAG_TRUE         
002  TREE_CHILDREN    range(0)=[0..infinite]
003  TAG_TRUE         
004  ASG              name=p
005  LEAVE            
006  BRPUSH           branch=012 type=AND
007  ENTER            
008  NODE_REF         name=p
009  TREE_CHILD       
010  TAG_TRUE         
011  LEAVE            
012  NOT              
013  AND              

execute: E (4): '(null)'

execute: F (5): '(null)'

execute: G (6): '(null)'

execute: N (13): '(null)'

execute: O (14): '(null)'

execute: P (15): '(null)'

execute: Q (16): '(null)'

execute: R (17): '(null)'

execute: S (18): '(null)'

execute: T (19): '(null)'

execute: U (20): '(null)'

execute: V (21): '(null)'

execute: X (23): '(null)'

execute: Y (24): '(null)'

execute: Z (25): '(null)'


First match:

tree A A B B A->B C C A->C D D A->D E E p B->E F F B->F G G B->G H H C->H I I C->I J J C->J K K D->K L L D->L M M D->M N N H->N O O H->O P P I->P Q Q I->Q R R I->R S S J->S T T K->T U U K->U V V L->V W W L->W X X M->X Y Y W->Y Z Z W->Z

	Legend:
	Nodes have at most 3 lines:
		- name (mandatory)
		- user
		- list of map references
	square box means there are map items pointing to the node
	red means this node is the result of the expression

Summary of all matches:

tree A A B B A->B C C A->C D D A->D E E p(1) *1 B->E F F p(1) *1 B->F G G p(1) *1 B->G H H C->H I I C->I J J C->J K K D->K L L D->L M M D->M N N p(1) *1 H->N O O p(1) *1 H->O P P p(1) *1 I->P Q Q p(1) *1 I->Q R R p(1) *1 I->R S S p(1) *1 J->S T T p(1) *1 K->T U U p(1) *1 K->U V V p(1) *1 L->V W W L->W X X p(1) *1 M->X Y Y p(1) *1 W->Y Z Z p(1) *1 W->Z

	Legend:
	Nodes have at most 4 lines:
		- name (mandatory)
		- user
		- list of map references as "mapname(number-of-references)"
		- the number of times the given node was the result of the expression
	square box means there were map items pointing to the node
	red means this node was the result of an expression