How many variables does the following grammar have when converted to CNF?

Question

E -> E+T

E -> T

T -> (E)

T -> i

Comments

is there a way to do such questions?

Answer 1

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.

Comments

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?

---

Yes @gari. and CNF grammar should not contain null productions.

@joshi_nitish Infact I didn't know you can edit our answers :p haha.

---

Thanks @Ashwin :)