Spaces:
Sleeping
Sleeping
File size: 9,384 Bytes
48e7c56 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 |
BSc: Compilers Construction
===========================
Contents
--------
* [1 Compiler Construction](#Compiler_Construction)
+ [1.1 Short Description](#Short_Description)
+ [1.2 Prerequisites](#Prerequisites)
- [1.2.1 Prerequisite subjects](#Prerequisite_subjects)
- [1.2.2 Prerequisite topics](#Prerequisite_topics)
+ [1.3 Course Topics](#Course_Topics)
+ [1.4 Intended Learning Outcomes (ILOs)](#Intended_Learning_Outcomes_.28ILOs.29)
- [1.4.1 What is the main purpose of this course?](#What_is_the_main_purpose_of_this_course.3F)
- [1.4.2 ILOs defined at three levels](#ILOs_defined_at_three_levels)
* [1.4.2.1 Level 1: What concepts should a student know/remember/explain?](#Level_1:_What_concepts_should_a_student_know.2Fremember.2Fexplain.3F)
* [1.4.2.2 Level 2: What basic practical skills should a student be able to perform?](#Level_2:_What_basic_practical_skills_should_a_student_be_able_to_perform.3F)
* [1.4.2.3 Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios?](#Level_3:_What_complex_comprehensive_skills_should_a_student_be_able_to_apply_in_real-life_scenarios.3F)
+ [1.5 Grading](#Grading)
- [1.5.1 Course grading range](#Course_grading_range)
- [1.5.2 Course activities and grading breakdown](#Course_activities_and_grading_breakdown)
- [1.5.3 Recommendations for students on how to succeed in the course](#Recommendations_for_students_on_how_to_succeed_in_the_course)
+ [1.6 Resources, literature and reference materials](#Resources.2C_literature_and_reference_materials)
- [1.6.1 Open access resources](#Open_access_resources)
- [1.6.2 Closed access resources](#Closed_access_resources)
- [1.6.3 Software and tools used within the course](#Software_and_tools_used_within_the_course)
* [2 Teaching Methodology: Methods, techniques, & activities](#Teaching_Methodology:_Methods.2C_techniques.2C_.26_activities)
+ [2.1 Activities and Teaching Methods](#Activities_and_Teaching_Methods)
+ [2.2 Formative Assessment and Course Activities](#Formative_Assessment_and_Course_Activities)
- [2.2.1 Ongoing performance assessment](#Ongoing_performance_assessment)
* [2.2.1.1 Section 1](#Section_1)
* [2.2.1.2 Section 2](#Section_2)
* [2.2.1.3 Section 3](#Section_3)
- [2.2.2 Final assessment](#Final_assessment)
- [2.2.3 The retake exam](#The_retake_exam)
Compiler Construction
=====================
* **Course name**: Compiler Construction
* **Code discipline**: n/a
* **Subject area**: Programming Languages and Software Engineering
Short Description
-----------------
This course covers the following concepts: Overall compilation architecture; Lexical analysis; Syntax analysis; Semantic analysis; Code generation; Program optimization; Virtual machines and JIT technology.
Prerequisites
-------------
### Prerequisite subjects
### Prerequisite topics
Course Topics
-------------
Course Sections and Topics
| Section | Topics within the section
|
| --- | --- |
| Introduction to compilers and compiler construction | 1. Basic notions: source and target languages, target architecture, compilation phases.
2. The history of languages and compiler development. Typical compiler examples.
3. Compilation & interpretation. Virtual machines, JIT & AOT technologies. Hybrid modes.
|
| Lexical, syntax and semantic analyses | 1. Compilation pipeline & compilation data structures
2. Lexical analysis and deterministic state automata
3. Bottom-up and top-down parsing
4. Principles of semantic analysis
|
| Code generation, optimization and virtual machines | 1. Low-level code generation: machine instructions, assembly language
2. Virtual machines’ architecture and their byte codes.
3. The notion of language projections.
4. Introduction to optimization techniques.
|
Intended Learning Outcomes (ILOs)
---------------------------------
### What is the main purpose of this course?
The software development process and the depth of programming cannot be understood without a detailed analysis of the compilation process, from the lexical analysis to the syntactical and semantic analysis up to code generation and optimization, and without understanding both strength and limitation of this process. This course dig deeper into this topic building on the fundamental notions studied in theoretical computer science of which is the natural continuation. The typical compiler pipeline will be studied and a project will allow students to practice with the relevant tools.
### ILOs defined at three levels
#### Level 1: What concepts should a student know/remember/explain?
By the end of the course, the students should be able to ...
* Understanding in depth the compilation process
* Realizing the limits of the process and of Semantic Analysis
* Read and write grammars for programming language constructs
* Perform lexical analysis and use lexical analyzer generators
* Perform top-down parsing, bottom-up parsing and use parser generators
* Perform semantic analysis
#### Level 2: What basic practical skills should a student be able to perform?
By the end of the course, the students should be able to ...
* How to design and develop compilers and language-related tools.
* The contents of each phase of the compilation process.
* How integrate compilers into an IDE.
* How to design a virtual machine for a language.
#### Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios?
By the end of the course, the students should be able to ...
* To be able to develop a language compiler.
Grading
-------
### Course grading range
| Grade | Range | Description of performance
|
| --- | --- | --- |
| A. Excellent | 85-100 | -
|
| B. Good | 75-84 | -
|
| C. Satisfactory | 60-75 | -
|
| D. Poor | 0-59 | -
|
### Course activities and grading breakdown
| Activity Type | Percentage of the overall course grade
|
| --- | --- |
| Labs/seminar classes | 40
|
| Interim performance assessment | 40
|
| Exams | 30
|
### Recommendations for students on how to succeed in the course
Resources, literature and reference materials
---------------------------------------------
### Open access resources
* Alfred V.Aho, Monica S.Lam, Ravi Sethi, Jeffrey D. Ullman. Compilers. Principles, Techniques, & Tools, Second Edition, Addison-Wesley, 2007, ISBN 0-321-48681-1.
* N. Wirth, Compiler Construction, Addison-Wesley, 1996, ISBN 0-201-40353-6
* <http://www.ethoberon.ethz.ch/WirthPubl/CBEAll.pdf>, 2005
### Closed access resources
### Software and tools used within the course
Teaching Methodology: Methods, techniques, & activities
=======================================================
Activities and Teaching Methods
-------------------------------
Activities within each section
| Learning Activities | Section 1 | Section 2 | Section 3
|
| --- | --- | --- | --- |
| Development of individual parts of software product code | 1 | 1 | 1
|
| Homework and group projects | 1 | 1 | 1
|
| Oral polls | 1 | 0 | 0
|
| Discussions | 1 | 1 | 0
|
| Reports | 0 | 1 | 0
|
Formative Assessment and Course Activities
------------------------------------------
### Ongoing performance assessment
#### Section 1
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | What is compilation process? | 1
|
| Question | What’s the difference between compiler and interpreter? | 1
|
| Question | How to compile a program? | 0
|
| Question | How to run a program? | 0
|
| Question | How to debug a program? | 0
|
#### Section 2
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | Abstract syntax tree & symbol tables: what is it for and how create and manage them? | 1
|
| Question | How to organize communication between compilation phases? | 1
|
| Question | What are basic differences between bottom-up and top-down parsing? | 1
|
| Question | How to implement a hash function for a symbol table? | 0
|
| Question | How to write a grammar for an expression using YACC/Bison tool? | 0
|
#### Section 3
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | What’s the difference between assembly and machine instructions? | 1
|
| Question | What’s the similarities and differences between real target platforms and virtual machines? | 1
|
| Question | Explain some of widely used approaches for optimizing program source code? How these approaches can be implemented in a compiler? | 1
|
| Question | Explain the idea behind the notion of control flow graph. | 0
|
| Question | What is “basic block” in CFG and what is it for? | 0
|
### Final assessment
**Section 1**
1. What are significant phases of a compilation process?
2. Why do we need optimization phase?
3. What’s the difference between syntax and semantic analyses?
**Section 2**
1. Characterize the principles of top-down and bottom-up parsing.
2. Explain how a symbol table can be implemented.
3. AST: is it a tree or a graph? What’s about semantic attributes in an AST?
**Section 3**
1. Give some simple examples of language-code projections.
2. How the object code for an expression can be optimized?
3. How to avoid tail recursion while optimizing code?
### The retake exam
**Section 1**
**Section 2**
**Section 3**
|