Using left$-$factoring and$/$or elimination of left recursion give a grammar equivalent tothe below grammar where the immediate problems preventing the use of recursivedescent parsing have been removed. The terminal alphabet is

$\{$a$,$ b$,$ c$,$ d$\}$

and S is the start variable:

S $-$dd $|$ Sa $|$ Sbc $|$ cc $|$ e