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 qo = 1.0;
double counan = 3.0;

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

(qo % counan * 3 * 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 ecchi = 3.0;
int ien = 4;
double u = 5.0;
int choadme = 3;

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

1 != 1 && ecchi > ien && u != choadme

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

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:

• Class relationships: Correct Solution (rmb1-vnru-00f5-gjxz)
• Static and runtime types: Correct Solution (wtbp-82od-73zd-jfks)
• While loops and for loops: Correct Solution (2ch9-mvnv-b76c-sen)
• Static and runtime types: Correct Solution (wtj5-959r-jehy-7r7z)