Given the following grammar I have been asked to describe the language it generates:

$\displaystyle S \rightarrow aT $

$\displaystyle T \rightarrow a \,|\, UTV $

$\displaystyle U \rightarrow ab \,|\, ba $

$\displaystyle V \rightarrow ac \,|\, ca$

I started with some examples:

$\displaystyle S \implies aT \implies aa$

$\displaystyle S \implies aT \implies aUTV \implies abTac \implies abaac$

$\displaystyle S \implies aT \implies aUTV \implies baTca \implies baUTVca \implies baabaacca$

So my description is:

A language where b's and c's are balanced (including zero of each) centred around an a, such that there will always be 1 more a than the number of b's or the number of c's.

The exact question is "What language is generated by the grammar?", given this information would you agree that this is an adequate answer?

Thanks