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

S→ aB/abA→aAB/aB→ABb/bIs the given grammar G a context-free grammar? Justify your answer with anexplanation. Additionally, using the string "aaaabbbb," determine if the grammar G isambiguous or not by analysing its production rules and derivation.

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

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

Consider the Grammar, G, with the production rule: S-> aS | bS | ε Which of the following is generated by G? Options :{a n b m | m,n >=0}{w ∈ {a, b}*, w has equal number of a’s and b’s}{a, b}*{an |n >=0} ∪ {bn |n >=0} ∪ {anbn |n >=0}

Consider the following grammar G G: S → EF   E → a|∈F → abF|ac                  Which of the following is true about the grammar G?1. G is a LL(1) grammar2. G is a regular Grammar                                                                 1 only2 only1 and 2 bothNone of these