Determining Language from Context Free Grammar
Structural induction would prove the following:


All words generated from $S$ have the same number of 0s and 1s.
All words generated from $A$ have an excess of one 0.
All words generated from $B$ have an excess of one 1.


Presumably the reverse is also true, but I'll leave such pondering for you.