Module 03 Study Guide

Learning Objectives

• Describe how finite automata can be used to recognize regular languages
• Explain the difference between finite automata and pushdown automata
• Explain the difference between top-down and bottom-up parsers
• Describe the relationship between LL and LR grammars and parsers
• Describe the data structures used to implement top-down and bottom-up parsers

Resources

• CPL Chapter 4
• Slides: Lam

Deliverables

The quiz for this module will be due on Canvas this Friday at the time given on the Canvas assignment. You will have an opportunity to re-take a different version of the same quiz next week. If you choose to do the re-take, your grade for this module will be the higher of the two scores.