Removing Left Recursion
The fact confusing you might be, that the given grammar isn't left recursive at all and so nothing has to be done.

To be left recursive there would have to be a nonterminal Symbol, that by a chain of productions results in a sequence of sybols starting with the same nonterminal.

This is not true for A since after A -&gt; B the only options available are A -&gt; B -&gt; dab and A -&gt; B -&gt; cB both already starting with terminal symbols on the left.

Trivially the same goes for B as B -&gt; dab and B -&gt; cB are the only options.

Taking a look at C the production C -&gt; cB can't cause any trouble, since the sequence is already starting with a terminal.

But even the second option C -&gt; Ac is harmless, as after C -&gt; Ac -&gt; Bac the only options are C -&gt; Ac -&gt; Bac -&gt; dabac and C -&gt; Ac -&gt; Bac -&gt; cBac, both starting with a terminal symbol again.