Teshreen University, CS College, Compilers Course 2006-2007
This course covers the essentials of designing a front-end compiler, it starts with showing the main phases of compilation process, a brief revision of Automata theory and Context-Free Grammar, afterwards, introduces various Parsers, beginning with an extensive study of Top-Down Parsing then Bottom-Up parsing focusing on the later one by studying LR(k), SLR(1) and LALR(1) showing the pros and cons of each of which.
Course Outline
Here are the main topics of compilers course as is was given in 2006-2007:
Part I: Introduction to Compilers
Introduces the idea and use of compilers, then shows the main phases of compilation process focusing on front-end compiler, then gives a brief revision of Automata theory and its relations with the first phase of compilation process, and Context-Free Grammer models; its properties and representation.
Part II: Top-Down Parsing
Studies Top-Down Parsing style, how it works, and why it's a problematic style, then introduces two Top-Down Parsing algorithms: Recursive Descent Parsing, and Predictive Parsing after defining important concepts such as FIRST and FOLLOW, then defines the LL1 Grammar and gives the computational model of Predictive Parsing and LL(K).
Part III: Bottom-Up Parsing
Comprehends an extensive study of Bottom-Up Parsing (around 50% of course time), it starts by defining concepts associated with the subject such as FIRST-k, FOLLOW-k, ACTION, GOTO, LR(K) ... then introduces Shift-Reduce Parsing Using ACTION/GOTO Tables, and how to enhance it in gradual complexity by using LR(0), SLR(1), LR(1), and LALR(1).
Instructor
Dr. Naser Naser
Required Book(s)
Lecture notes are relatively sufficient, however, here are the suggested references (extra references are omitted because they were written in German!):
Requirements
ActivitiesPercentage
Final Exam80%
Practice Test I5%
Practice Test II5%
Project10%
Voila! a new subject has
Voila! a new subject has been added !