Theory of computations(CFG)

Question

$L1$ has the following grammar:-

$S \rightarrow aB/BA$

$A\rightarrow bAA/aS/a$

$B\rightarrow b/bS/aBB$

can someone help me with an easy way to get the general expression for string belonging to this language.

Or some hint that how should I proceed to solve this question.

Comments

general expression for string??

not getting you

---

I mean how can we write the expression for all accepted strings

 

Like

S->a/aS/b/bS

Can be seen as

L=W such that W belongs to (a+b)+

 

Hope it helps to clarify.

---

I think this grammar produces all even length strings with $n_{a} = n_{b}$ but not $\epsilon$

---

Thanks