This document discusses the syntax tree representation rules used in the JBVD Java bytecode viewer and decompiler algorithm. Each node in the syntax tree represents a statement or the end of a statement, with nodes having up to two children - a left child for a green arrow and a right child for a red arrow. Various statements and nested statements that can be represented as nodes in the syntax tree are listed, including do-while, while, if, if-else, switch, and different combinations of nested statements.