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 da = 1;

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

1 * 2 + da

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 tustgli = true;
int ael = 6;
int fre = 9;

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

tustgli && ael > fre

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")

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:

• Drawing ASTs for expressions: Correct Solution (b2di-r4v9-rbsn-9pjo)
• Class relationships: Correct Solution (repL-k4f7-8e65-8kLd)
• Class relationships: Correct Solution (rL31-ugvu-k5r0-qm8f)
• Class declarations and object modeling: Correct Solution (17x8-ibet-689h-cqvj-h)
• Closures and event handling: Correct Solution (Lyn9-ozg1-hg8u-7kfy)