Consider the grammar G with Productions
$S \rightarrow A|B,$ $A \rightarrow λ,$ $B \rightarrow aBb,$ $B \rightarrow b$.
Construct a Grammar $\hat{G}$ by applying the algorithm in Theorem 6.3.
64.3k questions
77.9k answers
244k comments
80.0k users