initSyntaxTreeMC() getOptionSyntaxTreeMC()[0] Math.ceil(CorrectAnswer/2) randRangeUnique(CorrectAnswer-half,CorrectAnswer+half,4) wrongAnswers[0] wrongAnswers[1] wrongAnswers[2] wrongAnswers[3]

What is the total number of nodes (both interior and leaf nodes) in the parse tree for the following λ expression?

CorrectAnswer
  • Option0
  • Option1
  • Option2
  • Option3

Remember to count all leaf nodes, including one node for each λ and one node for each dot.

There is also one node for each left parenthesis and one node for each right parenthesis.

There is also one leaf node for each variable, in addition to the interior node for the non-terminal <var>.

After you have built enough parse trees, you should notice patterns that allow you to answer this question without building a parse tree.