Nested-count context-free grammar (source code)

= Nested-count context-free grammar

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