0 votes 0 votes 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. Theory of Computation theory-of-computation simplification peter-linz peter-linz-edition4 + – Mk Utkarsh asked Mar 23, 2018 edited Mar 4, 2019 by Naveen Kumar 3 Mk Utkarsh 741 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments ankitgupta.1729 commented Mar 23, 2018 reply Follow Share Ohh sorry.. I thought u were talking about "B" which was mentioned in that image.. 0 votes 0 votes Mk Utkarsh commented Mar 23, 2018 reply Follow Share so the answer should be $S \rightarrow B|λ,$ $B \rightarrow aBb,$ $B \rightarrow b$. am i correct? 1 votes 1 votes ankitgupta.1729 commented Mar 23, 2018 reply Follow Share yes.. 1 votes 1 votes Please log in or register to add a comment.