Let V = { S, A, B, a, b, λ} and T = { a, b }, Find the
languages generated by the grammar G = ( V, T, S, P } when the set
of productions consists of:
S → AB, A → aba, B → bab.
S → AB, S → bA, A → bb, B → aa.
S → AB, S → AA, A → Ab, A → a, B → b.
S → A, S →...