Context-Free Grammars – Chomsky Normal Form. Lecture 16 Section 2.1 Wed, Sep 26, 2007. Chomsky Normal Form. A context-free grammar is in Chomsky Normal Form (CNF) if each rule is of the form A BC , or A a , where B and C are not S . Furthermore, the rule S is allowed.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Wed, Sep 26, 2007
where B and C are not S.
because in the original, S could be replaced by .
for all terminals appearing in strings of length 2.
and rewrite the string ab as AB.
EE + E | E * E | (E) | a | b | c