Nested-count context-free grammar

A context-free grammar can enforce sums such as $0^n{1}^m{0}^{n+m}$ by nesting one matched terminal pair for each independent count.