• 2022-06-17
    Grammer G[]= ( {b} , {N , B} , N , {N→b│ bB , B→bN} ), The language described in this grammar is ().
    A: L(G[N])={bi│
    i ≥ 0}
    B: L(G[N])={b2i│
    i≥ 0}
    C: L(G[N])={b2i+1│
    i ≥ 0}
    D: L(G[N])={b2i+1│
    i ≥ 1}