Machine-translated by Google. Questions are authored in English.
Top

Discussion

An expression grammar is made to reflect operator precedence by

  • A.introducing one nonterminal level per precedence level
  • B.listing the higher precedence operators first in the productions
  • C.attaching numeric precedence values to the terminal symbols
  • D.requiring the programmer to parenthesise every subexpression

Answer: A

Correct answer: introducing one nonterminal level per precedence level

Each level of the hierarchy - expression, term, factor - corresponds to one precedence level, and because a lower level can only be reached through a higher one, the tighter-binding operators end up deeper in the tree. Associativity follows from whether the recursion is on the left or the right of the production.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.