CS5311 Reading List: Week 11

Slides

• Read slides on time complexity.
• Click here to download a set of slides for space complexity.

Assigned Reading

• 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. I may have problems about this algorithm in Quiz 2.