1 votes 1 votes Can ambiguous context free grammar be converted into CNF form..? Theory of Computation context-free-grammar conjunctive-normal-form + – Abhishekcs10 asked Sep 14, 2016 retagged Jul 8, 2019 by Cristine Abhishekcs10 276 views answer comment Share Follow See 1 comment See all 1 1 comment reply ManojK commented Sep 14, 2016 reply Follow Share I think no prblem.For ex take $\large S\rightarrow AbA |B$ $\large A\rightarrow a|\epsilon$ $\large B\rightarrow a|b$ Now apply the following Conversion. 0 votes 0 votes Please log in or register to add a comment.