Context free grammar for $1^k0^{2k}$ I need a hint for writing a context-free grammar for the language $L=\{1^k0^{2k}:k\in \mathbb N\}$. I'm starting to doubt that it can be done for general $k$.
Based on the comments:

$$S \to 1S00 \mid 100$$