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 pide = 5.0;
int a = 2;
double pogliol = 3.0;
double serpum = 1.0;

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

(pide - 4 % a / 3 * pogliol) * serpum % 8

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 renchon = 3.0;
double falscheent = 4.0;
boolean po = true;
int pistess = 1;
double es = 1.0;
double jottro = 5.0;
double asm = 4.0;

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

renchon == falscheent != po && (pistess < es && 8 >= jottro || 6 > asm) != 6 <= 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" + 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:

• Variable scope and lifetime: Correct Solution (gf5g-mknm-urip-s29t)
• Class declarations and object modeling: Correct Solution (17sx-0v3u-zwL6-4xa0-7)