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

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

You have a context-free grammar (CFG) defined as follows:S → aSbS → εWhich of the following strings is generated by this CFG?1 point"aabbb""aaabb""ab""bbb"

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

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.

The language generated by the below grammar is the set of ____________.S →→ aSa| bSb| a| b; a)all odd length palindromesb)all palindromesc)strings beginning and ending with the same symbold)all even length palindromes