Apply the specified parsing method, draw the corresponding automata and parsing tables, and show the detailed processes. If any functions are needed, such as FIRST, FOLLOW, provide them as well. If the specified parsing method does not work for the grammar, show the detailed process and explain why. Afterward, select and apply any parsing method that can analyze the grammar, and redo your parsing.

$LL(1)$

$P1$: $SAB|eDa||$

$P2$: $Aab|c||$

$P3$: $BdC$

$P4$: $CeC|lon||$

$P5$: $DfD|lon||$

$LR(0)$

$P1$: $SAa|bAc|Bc|bBa||$

$P2$: $Ad$

$P3$: $Bd$

SLR

$P1$: $S$AaAb

$P2$: $AbA$

$P3$: $Ad$

$P4$: $S$BbBa

$P5$: $Bd$

$LR(1)$

$P1$: $Sa+x+E$

$P2$: $Ea+E$

$P3$: $Ea$