Which representation of grammar corresponds to the a(aUb)*b expression?a)(1) S →→ bMa  (2) M →→  eb  (3) M →→  abM  (4) M →→  baMb)(1) S →→  aMb(2) M →→  e(3) M →→  aMb(4) M →→  bMac)(1) S →→ aMb  (2) M →→  e  (3) M →→  aM  (4) M →→  bMd)(1) S →→ baMab  (2) M →→  ea  (3) M →→  abM  (4) M →→  baMe)(1) S →→  aMb(2) M →→  Mab(3) M →→  aM(4) M →→  bM

Which regular grammar generates the language consisting of strings containing "aba" or "abb"?Options :S -> a | b | aS | bSS -> abS | abbS | εS -> abaS | abbS | εnone

Consider the Grammar as follows                                                                  S → aSAb | bSBc A → +AB | εB → *BC | εC → aC | d                     What is in FOLLOW(S) {b, c, +, *, $}{a, c, +, *, $}{a, b, d, *, $}{a, b, c, +, $}

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

Given grammar G:S->aS| ABA-> eB-> eD-> bReduce the grammar, removing all the e productions:ans.S->aS| AB| A| B, D-> bS->aS| AB| A| BNone of the mentionedS->aS| AB| A| B| a, D-> b

Which regular grammar generates the language consisting of strings with zero or more occurrences of "a" followed by "b"?Options :S -> ab | aS | εS -> a | b | aSS -> ab | aSnone