Normally, an LR parser traces a rightmost derivation (in reverse).
(a) How could an LR parser be modified to produce a leftmost parse as LL(1) parsers do? Describe your answer in terms of the algorithm in Figure 6.3.
(b) Would it help if we knew that the LR table was constructed for an LL grammar?
Figure 6.3
