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

Discussion

Assertion (A): A bottom-up parser traces out a rightmost derivation in reverse.
Reason (R): Each reduction replaces a right side by its left side, undoing the last step of that derivation.

  • A.A is false but R is true
  • B.Both A and R are true, and R is the correct explanation of A
  • C.Both A and R are true, but R is not the correct explanation of A
  • D.A is true but R is false

Answer: B

Both are true and the reason gives the mechanism, and this is why the handle is always the leftmost complete right side. Reversing the sequence of reductions yields a rightmost derivation of the input from the start symbol.

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

Post your comment

Please log in or register to post a comment.