Which of the following correctly describes $\text{LR}(k)$ parsing?
- The input string is alternately scanned left to right and right to left with $k$ reversals.
- Input string is scanned once left to right with rightmost derivation and $k$ symbol look-ahead.
- $\text{LR}(k)$ grammers are expressively as powerful as context-free grammers.
- Parser makes $k$ left-to-right passes over input string.
- Input string is scanned from left to right once with $k$ symbol to the right as look-ahead to give left-most derivation.