0 votes 0 votes Eliminate all unit-productions from the grammar $S \rightarrow a | aA| B|C,$ $A \rightarrow aB | λ,$ $B \rightarrow aA,$ $C \rightarrow aCD,$ $D \rightarrow ddd $ Theory of Computation theory-of-computation peter-linz peter-linz-edition4 context-free-grammar + – Mk Utkarsh asked Mar 22, 2018 edited Mar 4, 2019 by Naveen Kumar 3 Mk Utkarsh 468 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply ankitgupta.1729 commented Mar 22, 2018 reply Follow Share S→a|aA A→aaA|λ C is useless here 3 votes 3 votes akshat sharma commented Mar 23, 2018 reply Follow Share first we have to eliminate unit production then we can eliminate use less symbol ?(if it is reqired ) 0 votes 0 votes Mk Utkarsh commented Mar 23, 2018 reply Follow Share akshat this is exercise question so if we don't remove then also its fine 0 votes 0 votes Mk Utkarsh commented Mar 23, 2018 reply Follow Share akshat i misinterpreted your question. It is beneficial to remove useless production in the end of all the other removals of CNF or in the beginning. However it is not compulsory but removing in the beginning or end reduces the chance of error. 2 votes 2 votes Please log in or register to add a comment.