Give a CFG Contextfree Grammar over the alphabet 01 that gen

Give a CFG (Context-free Grammar) over the alphabet {0,1} that generates the following language:

Solution

seems like you wanted to say this

L = {0ⁱ1^j | 1ij2i}

If yes then the following grammar ensures that there can be half or lesser 0’s for the 1’s that are present:

if not please type question exactly on j\'s relation with i if any or provide how you are converting value to 2i.

if you need j = 2i then