Can I couple non-terminals in context-free grammars?
In your case, the desired language is finite, so you can just go

$\qquad\displaystyle S \to 1 \mid 011$.

If you had recursion, say

$\qquad\displaystyle S \to ASB \mid 1$

as starting rule, you can not force "matching" $A$ and $B$ to behave in sync.
There are more powerful types of grammars that can do that, but that's beyond
the power of context-free.