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 i = 7;
int meslost = 4;

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

7 * 9 - i * meslost + 1

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 sti = false;
boolean pu = true;
int onth = 9;

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

(7 >= 2 || sti) && pu && onth < 7

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

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:

• Booleans and conditionals: Correct Solution (5oi3-t9v1-krgu-tixk)
• Class declarations and object modeling: Correct Solution (17wL-8702-fhvn-c29i-9)
• Static and runtime types: Correct Solution (wtan-9tt5-i4Lv-qnwd)