Question

A handle in a bottom-up parser is a substring that matches the right-hand side of a production and whose reduction represents:

• A. The next step in a derivation.
• B. One step in the reverse of a rightmost derivation.
• C. The leftmost leaf of the parse tree.
• D. A terminal symbol to be shifted.

Hint:

In a deterministic LR parser, there is exactly one handle in every right-sentential form. Finding this handle is the core task of the parsing algorithm.

Answer 1

The Correct Option is B