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 cesm = 3.0;
double ispess = 5.0;

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

1 * cesm * ispess - (2 + 0)

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 wueal = 6;
int ec = 4;
int pral = 1;
boolean olci = true;
boolean sengpe = true;

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

wueal != 9 || !(ec > pral) || olci || sengpe

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:

• Class declarations and object modeling: Correct Solution (17ww-upaw-faoi-zz6h-5)
• Class declarations and object modeling: Correct Solution (17un-whv6-wqqx-x8ov-i)
• Static and runtime types: Correct Solution (wtby-3cfq-u77i-Lmnb)
• Closures and event handling: Correct Solution (Lwe6-x4zr-iL3q-L8po)