For the grammar G with the following productions S SS T T a

For the grammar G with the following productions

S SS | T
T aTb | ab

describe the language L(G).

Solution

Answer:

L(G) =  (a^m b^m , m>= 1 )+

Here if we simplify T, we will get a^m b^m m>= 1 . If we simplify S we will get one or more T\'s . So (a^m b^m , m>= 1 )+

Like : abaabbabaaabbb