Given the context-sensitive grammar production rule: S → aBC, where B → b and C → c, what language does this grammar generate?1 point{a^n b^n c^n | n ≥ 0}{a^n b^n | n ≥ 0}{abc}{a, b, c}

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}

Which class of grammars is the most powerful in terms of generating languages? Options : Context-free grammars Context-sensitive grammars Unrestricted grammars Regular grammars

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

Q: 08 of 15Choose the right set of terminals from the given production rules of grammar as:S->(S) | aA | epsilonA-> A+B | aB-> B *C | bC -> cOptions :T= ( ,a,b,),+,*T= ( ,a,b,),+,*,cT= a,b,cNone of the above mentioned

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 | aS S -> ab | aS none