This preview shows page 1. Sign up to view the full content.
Unformatted text preview: } * | w = a n b n c n } is not context free.) Problem 3. Convert the following grammar into Chomsky Normal Form: A BAB | B | B 00 | . Problem 4. Prove that every Regular language is also Context Free (i.e. there exists a CFG for all L Reg ). 1...
View Full Document
This note was uploaded on 04/29/2010 for the course ECS 222 taught by Professor Mr. during the Spring '10 term at UC Davis.
- Spring '10