$S$ABC

$A$aAB$|$

$BbBC|$

$CcC|dD|$

$DeD|f$

Construct:

a$.$ First from grammar above!

b$.$ Follow from grammar above!

c$.$ Table of moves made by predictive parser on input string: aabbceddff

Conversion RE to DFA.

For the following Regular Expression:

$(a|b)*abb(a|b)+$

For the following grammar CFG:

$AAa|Ab|Bc|Bd|B$

$BaB|bB|dZe|$ def $|c$

$Zde$

Eliminate the left recursion from the grammar above and do left factoring!