Let G be the following grammar with production rules
S → aSbS | bSaS | ε
Which of the following describes L(G)?

Question

Let G be the following grammar with production rules  
 S → aSbS | bSaS | ε 
 Which of the following describes L(G)?

Answer

The set of all strings of the form a^n b^n.

Answer

The set of all even-length strings.

Answer

The set of all palindromes over {a,b}.

Answer

The set of all strings with equal number of a’s and b’s.

Crowdly