Equivalent unambiguous grammar
Your grammar generates the language $L(A)^*$, where
$$
L(A) = \{0^i 1^j : j \geq i\}.
$$
You can generate $L(A)$ unambiguously in many ways. Two options are:


Use $0^i 1^j = 0^i 1^i 1^{j-i}$.
Use $0^i 1^j = 0^i 1^{j-i} 1^i$.


Given that, the current productions for $S$ will already generate $L(A)^*$ unambiguously.