Search code examples
parsingcompiler-constructiongrammarleft-recursion

How to solve this Grammar through SLR?

I want to solve this Grammar.
S->SS+
S->SS*
S->a

I want to construct SLR sets of items and parsing table with action and goto. Can this grammar parse without eliminate left recursion. Is this Grammar SLR.

Solution

    1. No, this grammar is not SLR. It is ambiguous.

    2. Left recursion is not a problem for LR parsers. Left recursion elimination is only necessary for LL parsers.