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 ce = 3;
int renmoor = 4;
int pe = 1;
double bi = 5.0;

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

4 + 9 + ce * renmoor - pe % bi

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 nunt = false;
boolean sidwa = true;
double sheji = 1.0;
boolean kess = false;

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

(nunt || 3 > 0 || sidwa) != (5 == sheji) && kess

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:

• Drawing ASTs for expressions: Correct Solution (az8f-3duq-7wg2-Ley8)
• Class declarations and object modeling: Correct Solution (17vm-py8o-i2e7-52wa-v)