Drawing ASTs for expressions: Correct Solution

For each of the Java expressions below:

• Draw an AST for the expression.
• Show how the expression evaluates at each node in the tree.

Be sure that your tree accurately reflects how Java would evaluate the expression.

Part 1

Given the following variables:

int cefe = 2;
double gincin = 1.0;

...draw the AST and evaluation results for the following expression:

cefe % gincin % 6 % 9

Solution

Things to double-check in your solution:

• Do you have the left and right branches on the correct side?
• Did you indicate the difference between ints and floating point values?

Part 2

Given the following variables:

int ingtil = 1;
int a = 2;
double pism = 4.0;
int cau = 4;

...draw the AST and evaluation results for the following expression:

1 != ingtil && a == pism && 3 == cau

Solution

Things to double-check in your solution:

• Does your tree correctly reflect the precedence of && and ||?
• Did you correctly show short-circuiting? (That is when the right branch of && or || is never evaluated because the left branch already determines the answer.)

Part 3

Draw the AST and evaluation results for the following expression:

0 + "1" + (2 + 3 + 4)

Solution

Things to double-check in your solution:

• Did you indicate the distinction between ints and Strings?
• Are your left/right branches correct?

Related puzzles:

• Closures and event handling: Correct Solution (Lzkq-Lz23-866n-vx1s)
• Drawing ASTs for expressions: Correct Solution (b4oo-Lpzi-7528-n0nh)