Lecture 17

Learning objectives

After this class, you should be able to:

1. Given a context free grammar, convert it to Chomsky and Greibach Normal Forms.
2. Prove the correctness of the algorithm for conversion to Chomsky Normal Form.
3. Given a context free grammar and a string, use the CYK algorithm to determine whether the string is in the language accepted by the algorithm and show the string's derivation from the grammar.

Reading assignment

1. Sections 6.2, 6.3.
2. Lecture 16-17 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 6.2, exercise #2.
  2. Section 6.2, exercise #3.
  3. Section 6.2, exercise #10.
  4. Section 6.3, exercise #1 (only the string aabb).
  5. Section 6.3, exercise #2.

• Questions on next lecture's material
  1. None.

---

Last modified: 18 Jan 2014