1 votes 1 votes E -> E+T E -> T T -> (E) T -> i Theory of Computation conjunctive-normal-form theory-of-computation + – gari asked Nov 18, 2017 gari 1.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply gari commented Nov 27, 2017 reply Follow Share is there a way to do such questions? 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes E -> ET’ / i T’ -> PT P -> + E -> RE’ R -> ( E’ -> ES S -> ) T -> RE’ T -> i Here the key point is E->T so don't take it T epsilon. Simply take E-->(E) hence we can solve this. Total {E,T',P,R,E'S,T} 7 variables. Ashwin Kulkarni answered Dec 1, 2017 edited Dec 1, 2017 by Ashwin Kulkarni Ashwin Kulkarni comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments gari commented Dec 1, 2017 reply Follow Share Hi thanks for ur analysis. So if a cfg is to be converted to cnf, We should remove null production and unit productions. As they will be a problem while converting. Is it true? 0 votes 0 votes Ashwin Kulkarni commented Dec 1, 2017 reply Follow Share Yes @gari. and CNF grammar should not contain null productions. @joshi_nitish Infact I didn't know you can edit our answers :p haha. 1 votes 1 votes gari commented Dec 1, 2017 reply Follow Share Thanks @Ashwin :) 0 votes 0 votes Please log in or register to add a comment.