Construct context-free grammars that generate for the languages L(G) = {01(110)^n 10 (11)^n : n >= 0}
Hint, the grammar $S \to a S c \mid b$ generates the language $\{a^n b c^n : n \geq 0\}$. Can you you adapt this? Do you understand why it generates that language?