A grammar G = (V, ∑∑, S, P) in which V represents:a)None of the mentionedb)Set of Non Teminalsc)Set of Terminalsd)Productione)Start symbols

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

A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals. aabbaba aabaaba abababb aabbaab

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

In CFG terminal symbols are denoted by ____.