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 ba = 3.0;
double am = 1.0;
int plad = 6;

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

6 - (ba - 1 - am) % 7 * plad

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 sephasm = true;
int stoura = 7;
int striormol = 8;
double bi = 2.0;

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

(sephasm != 9 <= 2 == stoura >= striormol && bi > 5 && 4 >= 3)

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

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:

• Class declarations and object modeling: Correct Solution (17uk-5fya-anfd-sizi-9)
• Class declarations and object modeling: Correct Solution (17sg-hzik-s2x0-drkb-4)
• Static and runtime types: Correct Solution (wtgw-1241-3gt9-6y2n)