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 tusel = 5;
int plilhet = 4;
double maise = 4.0;
double ske = 3.0;
int assciss = 4;

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

0 / tusel - plilhet * maise - ske + assciss + 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:

double ri = 1.0;
boolean tisreff = false;
boolean scrimsnen = false;
double e = 5.0;

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

6 < 9 && !(9 <= 6) != !(ri <= 3) == tisreff && scrimsnen || 2 <= e

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:

• Booleans and conditionals: Correct Solution (5mdc-zqpa-ftrm-Ln5e)
• Class declarations and object modeling: Correct Solution (17t5-j1dp-gbfj-f656-a)
• Drawing ASTs for expressions: Correct Solution (b4ui-wf6n-c7rx-g7wx)
• Static and runtime types: Correct Solution (wtfr-rnsi-y9Lo-noig)