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 didkness = 1;

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

didkness % (3 + 6 / 4)

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:

double pned = 5.0;
boolean trei = true;
double hu = 1.0;

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

pned != 0 || (trei && 0 == hu)

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:

• Static and runtime types: Correct Solution (wtgh-22q0-h053-uh99)
• Static and runtime types: Correct Solution (wtr4-1j0z-91s6-kn6y)
• Class declarations and object modeling: Correct Solution (17sb-67gL-w66j-79rh-o)