You have a context-free grammar (CFG) defined as follows:S → aSbS → ε

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"

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, +, $}

Reduce the grammar to Chomsky normal formS→ ABAC | aCAA→ aA | εB→ bB | εC→ dD→ f

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 containing "aba" or "abb"? Options : S -> a | b | aS | bS S -> abS | abbS | ε S -> abaS | abbS | ε none