Among the set of productions given below, identify the production that belongs to context-free grammar.

The context free grammar that generates the string “aabdddd” is

Choose the incorrect statement

S  AAB

B   aB | bB | ε

A  a | b

The language generated by this grammar is,

The length of minimum length string that belong to the language represented by the CFG having productions, {S  0S1, S  A, A  1A0}, A  10}

Consider the context-free G{S,A}, {a,b,c,d},P, S) with the set of productions given below.

S -> dA | A

A -> bAbb | c

The language defined by the grammar is,

Identify the type of automata that may accept the language, L = {a*b*}

Consider the context-free grammar G given below.

S->XY

X->Xx | x

Y->y

The number of left-most parse trees, possible for the string “xxxy”

The language represented by the Grammar, G having productions is {S  0S1, S  A, A  1A0}, A  10} is,

Given the context-free grammar G: ({S},{a,b,e},P,S) with the production rules,

S  aSa |bSb |ɛ

Eliminate ɛ-production from G.