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 a = 1;
int theedbe = 5;
int wati = 3;
int mup = 4;

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

9 - 4 - a + theedbe - wati * mup + 7

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 rhespa = 5.0;
boolean sokick = false;
double doproest = 3.0;
double kheaccled = 4.0;
double senga = 1.0;

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

6 == 1 == 0 >= rhespa || sokick || !(6 >= doproest) && kheaccled <= 2 != senga < 9

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

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:

• Closures and event handling: Correct Solution (LviL-o5x7-2cnu-305s)
• Class declarations and object modeling: Correct Solution (17u0-6m6n-hjh7-ro3q-a)
• Static and runtime types: Correct Solution (wtap-94qy-t6by-gtso)