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 eu = 3.0;
double cunge = 3.0;
double locsiss = 3.0;
int prashin = 7;

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

9 + (eu * cunge % 8) - locsiss % prashin

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 tet = true;
int o = 4;
double lome = 5.0;
int fong = 4;
double duol = 3.0;

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

tet && o > 3 && lome <= 9 && !(fong <= duol) && 1 >= 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"

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 (rk5k-2ux0-905d-p2rj)
• Closures and event handling: Correct Solution (Lwh5-1yab-9321-9ii7)
• While loops and for loops: Correct Solution (w7qx-yvo7-xy72-jp)
• Class relationships: Correct Solution (rjcy-sf0g-5p7y-26hq)
• Closures and event handling: Correct Solution (Lwhf-a4re-ej8r-xfoL)