Finding the language of a context-free grammar?
Your grammar generates the language of all palindromes. It can be described in the following ways:


$L(G)$ is the language of all palindromes over $\{0,1\}$.
$L(G) = \{ x \in \{0,1\}^* : x \text{ is a palindrome} \}$.
$L(G) = \{ x \in \{0,1\}^* : x^R = x \}$.


The first option is really the best, but unfortunately your TAs are expecting the third option.