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 fricba = 1.0;

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

fricba % 3 + 3 + 6 + 9

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 re = 1.0;
double sussvi = 4.0;
int jod = 3;
double chlis = 4.0;
boolean masket = true;
int hessniac = 9;

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

!(re > sussvi) && jod > chlis && masket && hessniac <= 1

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 (5L5i-xis9-f624-c9og)
• While loops and for loops: Correct Solution (yesL-iLi7-zzxp-vt)
• Class relationships: Correct Solution (rkig-3a9w-d3j2-t1o1)
• While loops and for loops: Correct Solution (36e9-y78g-v62x-5n6)