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 arphge = 7;
int trel = 7;
int mu = 9;
double tre = 5.0;
int al = 2;

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

7 - arphge - trel % 4 / mu - tre * 2 % al

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 daullis = 7;
double criode = 3.0;
boolean phlambad = false;
double masple = 2.0;
double blalstras = 1.0;
boolean me = false;

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

!(5 <= daullis) || criode > 1 && phlambad == 1 > 3 != 7 < masple || !(blalstras > 0) != me

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" + 8

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 (5ikz-82ki-h4c1-b15t)
• While loops and for loops: Correct Solution (1m0k-L6fr-2p05-ign)
• Variable scope and lifetime: Correct Solution (gf2r-w6wy-zsz4-Ltu6)
• Drawing ASTs for expressions: Correct Solution (azwx-410p-qxsb-4s0k)