The following context$-$free grammar has $-$rules.

$SJCB|K|$

$J$aJb$||$

$CcC||$

$K$aKcc$|B|$

$BbB||$

We want to build an equivalent CFG without any $-$rule.

Since $$ is in the language generated by this CFG$,$ you need to add a new start variable. Show the resulting CFG$.$

Give the list of nullable variable$($s$)$ other than the new start variable.

Use the algorithm we saw in class to build an equivalent CFG without $-$rules other than from the new start variable.