automata – Finding the language generated by this grammar

I’m having problems with this. Can someone help me please.

Find the language generated by this grammar over the alphabet ${0,1}$:

$Srightarrow BABmid CAB$

$BA rightarrow BC$

$CA rightarrow AAC$

$CB rightarrow AAB$

$Arightarrow 0$

$B rightarrow 1$