edited by
2,465 views
16 votes
16 votes

Which of the following correctly describes $\text{LR}(k)$ parsing?

  1. The input string is alternately scanned left to right and right to left with $k$ reversals.
  2. Input string is scanned once left to right with rightmost derivation and $k$ symbol look-ahead.
  3. $\text{LR}(k)$ grammers are expressively as powerful as context-free grammers.
  4. Parser makes $k$ left-to-right passes over input string.
  5. Input string is scanned from left to right once with $k$ symbol to the right as look-ahead to give left-most derivation.
edited by

2 Answers

Best answer
18 votes
18 votes
  1. Does not make any sense. false.
  2. This is definition of LR($k$) Parser. True
  3. False. LR($k$) is subset of CFL.
  4. False.
  5. LR($k$) , bottom up parser . We have Right most derivation. This is False.

Answer :- B

edited by
Answer:

Related questions