CS5311 Reading List: Week 10
-
Chapter 15
- Sections 1, 2 and 3.
These three sections cover everything discussed in class.
You can skip the proof of Cook's Theorem.
- Read the following paper to understand an efficient
way for parsing context-free languages:
J. Earley, An Efficient Context-Free Parsing Algorithm,
Communications of the ACM,
Vol. 13 (1970), pp. 94-102.
It is very easy for you to implement this algorithm.
So, implement this algorithm and use it to parse some
context-free languages.
- Click here to download a
copy of the overhead used in class.
- Exam