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
- Spring '10
- Formal language, Regular expression, Context-free grammar, Chomsky hierarchy