For the given Context free grammar reduce the following grammar SaBDh A Bbc | b DdD

For the given Context free grammar reduce the following grammar SaBDh A Bbc | b DdD

Given grammar G: S->aS| AB A-> e B-> e D-> b Reduce the grammar, removing all the e productions: ans. None of the mentioned S->aS| AB| A| B S->aS| AB| A| B| a, D-> b S->aS| AB| A| B, D-> b

Prove that the given grammar is LL(1) grammarS  aBDhB  cCC  D  EFE  F  

Whether or not is the following grammar LL(1)? Why (State the reasons.)? If thegrammar is not LL(1), then convert it to an LL(1) grammar. Next, present thetransition table and show the parsing process by parsing the string “ababbbb”according to the prepared transition table.• S->aAbB | bS• A->AbB|λ• B->Bb|a

Suppose A → xBz and B → y, then the simplified grammar would be:Select one:a. None of the mentionedb. A → xBz|xyzc. A → xyz d. A → xBz|B|y