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:

double pheh = 1.0;
int pirphid = 9;
double brabo = 1.0;
double o = 3.0;
int rerca = 8;
double bi = 5.0;

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

pheh % pirphid - brabo * o * rerca % 2 + bi

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:

boolean geudu = true;
int whiancho = 6;
boolean ve = true;
boolean co = true;
double pruss = 5.0;

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

(geudu == !(whiancho > 0) && ve != co != (9 != 0) != (!(pruss == 2)))

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 + (5 + 6 + "7")

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 (Lwso-karc-5h0b-5us2)
• While loops and for loops: Correct Solution (32a0-qbgd-dwuc-tjd)
• Class declarations and object modeling: Correct Solution (17vu-5L0k-ux3e-4j4r-L)