ace test series

Question

Answer 1

I think to give a grammar which is LL(1) equivalent to the one given you need to remove the left recursion. 

S  -> BS'
S' -> $\epsilon$ / cBS'
B  -> e / efg / efCg
C  -> cdC / S

Now to remove left factoring :

B   -> eB'
B'  -> $\epsilon$ / f / fCg (further broken down)

B'  -> $\epsilon$ / fB''
B'' -> $\epsilon$ / Cg

You can have a look at this : http://www.csd.uwo.ca/~moreno/CS447/Lectures/Syntax.html/node8.html
Also there is a good video lecture : https://www.youtube.com/watch?v=3_VCoBfrt9c