Efficiency/Redundancy in Chomsky normal form
I have a context-free grammar with the following production rules, S being the start symbol: S→ABA→aB→a Is this in Chomsky normal form? My problem is I thought CNF is supposed to be an efficient way to write a grammar, yet the grammar is not efficient in the sense that we can clean its rules as … Read more