Syntax Tree Data Structure used in

JBVD – Java Bytecode Viewer &

Decompiler algorithm

Syntax tree representation rules

• Every node represents a statement or the end of a

statement

• Each node has up to two children

• The left child is represented with a green arrow

• The right child is represented with a red arrow

• If a node lacks the left or right child, or even both

of them (the value is null), then they are not

represented at all

• Each node can have more than one parents

do while

Nested do whiles

while

Nested whiles

if

if - else

if – else if - else

Nested ifs (1)

Nested ifs (2)

Nested ifs (3)

Nested ifs (4)

do while - while

do while - if - else

while – do while

while - if - else

if – else – do while

if – else - while

switch