0 0 votes Start symbol generating ε. (e.g.; S-> ε)and also written Any Context-free Grammar without ε in its language has an equivalent CNF.source - https://www.geeksforgeeks.org/converting-context-free-grammar-chomsky-normal-form/I read the below page but still not getting clearance in doubt, S->null is allowed but language containing null will not contain equivalent CNF. can someone explain this?https://gateoverflow.in/188159/chomskey-normal-form Theory of Computation theory-of-computation + – Dknights 203 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes You are right. In general, ϵ is not allowed in the CNF form of grammars.But there is one exception in CNF - If the language itself contains an empty string. If that is the case then we have to make a new start symbol S' and write its production asS' -> S | ϵAlso refer https://cs.stackexchange.com/a/92411 mv_ind answered Nov 16, 2024 mv_ind comment Share Follow 0 reply Please log in or register to add a comment.