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

Discussion

Precedence declarations in a parser generator resolve conflicts by

  • A.converting the grammar automatically into an unambiguous form
  • B.comparing the precedence of the rule with that of the lookahead token
  • C.reordering the productions so the correct one is tried first
  • D.computing a rather more precise lookahead set for the offending state

Answer: B

Correct answer: comparing the precedence of the rule with that of the lookahead token

A production takes the precedence of its rightmost terminal unless one is assigned explicitly, and the conflict is settled by comparing that against the precedence of the lookahead. Higher rule precedence means reduce, higher token precedence means shift, and equal precedence is settled by the associativity declaration.

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

Post your comment

Please log in or register to post a comment.