Is this an LL(1) grammar? How to solve First – Follow conflict?


im trying to check if this grammar is LL(1).

S -> L = R
L -> * L | id
R -> L | R + R | num

As you can see there is a Left recursion on R production. So i remove that and what i get is:

S -> L = R
L -> * L | id
R -> L R’ | num R’
R’ -> + R R’ | ε

Now the problem that i have is that First and Follow set of R’ rule have a common non-terminal (“+”) and also FIRST(R) and FOLLOW(R’) has a common non-terminal. So i wonder how to create the parsing table if there’s this conflict. My question is: is there a way to solve this problem or simply this isn’t an LL(1) grammar?

Thanks.