CS 4510 Lecture Notes - Lecture 9: Institution Of Engineering And Technology, Noam Chomsky, Finite-State Machine
Document Summary
* all the hills ane of the form a a where aib , cane variables , B , c , cannot be s . a is terminal , Theohenri every context -free language is generated by context-free grammars in the chomsky normal form . Given any cfg transform it to cnf while preferring the language . et hat "stheonly ourallowed2. " start state rule no . add so as hell no . Remove a e except for if we have how do we do it ? add rules to replace - . we have : , since a can yield several things . " and the rule is so s . Ao add to it by r uv since a e - is one possibility . take this hill : But this change maintains the language& grows the grammar . little trick i with pre quae . in case. , we only add r e if we have not dealt.
