Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
didattica:choiceexams:flc:flc2014 [2015/02/10 10:57] mescal [Exams] |
— (current) | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Formal Languages and Compilers ====== | ||
| - | ---- | ||
| - | ===== News ===== | ||
| - | <WRAP center round important 95%> | ||
| - | * <wrap em>**February 5rd, 2015**</wrap>: {{:didattica:choiceexams:flc:semanticAnalysis.pdf|Here}} you can download the exercises on Semantic analysis discussed during last monday lesson. | ||
| - | * <wrap em>**February 3rd, 2015**</wrap>: {{:didattica:choiceexams:flc:mock1.pdf|Here}} you can download the exercises on Lexical and Syntax analysis discussed during last monday lesson. In the next days I will upload the exercises on Semantic Analysis with solutions. | ||
| - | * **January 17th, 2015**: timetable for next weeks lessons: | ||
| - | * Tuesday 20th, 3pm - 6pm | ||
| - | * Wednesday 21th, 10am-1pm | ||
| - | * Tuesday 27th, 3pm-6pm | ||
| - | * Wednesday 28th, 3pm-6pm | ||
| - | * **January 7th, 2015**: The description of the class project is available [[coolProject|here]] | ||
| - | * **December 18th, 2014**: By the end of the year I will publish here the assignment for the compiler constuction project. | ||
| - | * **December 17th, 2014**: I apologize but due to some delayed administrative duties, that I have to close by tomorrow and related to tomorrow defenses, I have to cancel tomorrow lesson. Next lesson will be on January 13th. I wish to all students a nice Christmas period. | ||
| - | * **November 23, 2014**: Due the participation to a European Project Meeting I will not be able to be in Camerino on next Thursday, November 27th | ||
| - | * **November 19th, 2014**: {{:didattica:choiceexams:flc:table.png?linkonly|Here}} the solution for the exercise started during the last class. | ||
| - | * **November 5th, 2014**: Dear students the course this year seems unlucky. I've got the flu and I'll not be able to come to Camerino tomorrow. | ||
| - | * **November 3rd, 2014**: I apologize but due to a deadline related to the management of the Computer Science curriculum I'll not be able to make the lesson tomorrow (November 4th). Next class will be on November 6th. | ||
| - | * **October 28th, 2014**: due to previous engagements I cannot be in Camerino on October 30th. Next class will be on Tuesday - November 4th. | ||
| - | * **October 17th, 2014**: the course web site is now on-line | ||
| - | </WRAP> | ||
| - | |||
| - | ---- | ||
| - | ===== General Info ===== | ||
| - | <WRAP box round 95% center> | ||
| - | **Teacher**: | ||
| - | * [[http://www.cs.unicam.it/polini|Andrea Polini]] | ||
| - | |||
| - | **Lessons schedule**: | ||
| - | * Tuesday, from 3pm to 5pm - room Turing | ||
| - | * Thursday, from 3pm to 5pm - room Turing | ||
| - | |||
| - | **Students reception hours**: | ||
| - | * Thursday from 2pm to 3pm | ||
| - | </WRAP> | ||
| - | ---- | ||
| - | ===== Course Objectives ===== | ||
| - | |||
| - | <WRAP box round 95% center> | ||
| - | The course intends to provide to the students the theoretical background to understand how a language compiler can be built. The general architecture of a compiler is presented and which are the tools and mechanisms (theoretical and practical) need in order to derive a real compiler. Competences are put in place with the construction of a simple compiler for a simple language. | ||
| - | </WRAP> | ||
| - | |||
| - | ---- | ||
| - | ===== Course Contents ===== | ||
| - | |||
| - | <WRAP round 95% center box> | ||
| - | * **General Introduction to Compilers construction** [ALSU - Ch.1] | ||
| - | * Structure of a compiler | ||
| - | * Evolution of programming languages | ||
| - | * Generalities on programming languages | ||
| - | * **Lexical Analysis** [ALSU - Ch.3] | ||
| - | * Lexical analysis objectives and issues | ||
| - | * Tokens and lexemes | ||
| - | * Regular expressions and definitions | ||
| - | * Finite Automata | ||
| - | * DFA - Deterministic Finite Automata | ||
| - | * NFA - Non Deterministic Finite Automata | ||
| - | * From rexp to NFA | ||
| - | * From NFA to DFA | ||
| - | * Recongnition of tokens | ||
| - | * **Syntax Analysis** [ALSU - Ch.4] | ||
| - | * Introduction to CF grammars and Push-Down automata | ||
| - | * Parse tree and derivations | ||
| - | * Ambiguity | ||
| - | * Top-down parsing | ||
| - | * Left recursion and left factoring | ||
| - | * Recursive descent parsing | ||
| - | * FIRST and FOLLOW sets | ||
| - | * Non recursive predictive parsing | ||
| - | * Error recovery in predictive parsing | ||
| - | * Bottom-up parsing | ||
| - | * Reductions, Handles | ||
| - | * Shift-reduce parsing | ||
| - | * LR(0) automaton and table | ||
| - | * SLR table | ||
| - | * LR(1) automaton and table | ||
| - | * LALR table | ||
| - | * Error recovery in LR parsing | ||
| - | * **Syntax-Directed Translation ** [ALSU - Ch.5] | ||
| - | * Syntax-Directed Definitions | ||
| - | * Inherited and Synthesized Attributes | ||
| - | * Dependency Graphs | ||
| - | * Syntax-Directed Translation Schemes | ||
| - | </WRAP> | ||
| - | ---- | ||
| - | ===== Study material ===== | ||
| - | <WRAP box round center 95%> | ||
| - | **Course Slides** | ||
| - | * {{:didattica:choiceexams:flc:01_introduzione2014.pdf|Introduction to the course}} (October 14th) | ||
| - | * {{:didattica:choiceexams:flc:02_lexicalanalysis2014.pdf|Lexical Analysis - I}} (October 21st) | ||
| - | * {{:didattica:choiceexams:flc:02_lexicalanalysis2014_2.pdf|Lexical Analysis - II}} (October 28th) | ||
| - | |||
| - | <wrap em>Warning:</wrap> //slides are provided here to help the students in their study. In no way they intend to substitute recommended text books. The deep study of books instead constitute the most wise approach to pass the exam.// | ||
| - | |||
| - | **Reference books** | ||
| - | * [ALSU] Alfred V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman, //[[http://www.amazon.com/Compilers-Principles-Techniques-Tools-Edition/dp/0321486811|Compilers - Principles, Techniques, and Tools]]//, 2nd Edition, Pearson Education 2007. | ||
| - | * [ANT] Terence Parr, //{{:didattica:choiceexams:flc:the_definitive_antlr_4_reference.pdf|The Definitive ANTLR 4 Reference}}//, The Pragmatic Programmers, 2012 | ||
| - | </WRAP> | ||
| - | ---- | ||
| - | ===== Exams ===== | ||
| - | <WRAP box round center 95%> | ||
| - | **Exam Dates A.Y. 2014/2015** | ||
| - | * February <wrap em>10th</wrap>, 2015 - from 3pm to 5pm - Boole Lab. Palazzo Battibocca | ||
| - | * February 24th, 2015 - from 3pm to 5pm | ||
| - | * June 9th, 2015 - from 3pm to 5pm | ||
| - | * July 7th, 2015 - from 3pm to 5pm | ||
| - | * September 8th, 2015 - from 3pm to 5pm | ||
| - | * September 29th, 2015 - from 3pm to 5pm | ||
| - | * February 9th, 2016 - from 3pm to 5pm | ||
| - | * February 23th, 2016 - from 3pm to 5pm | ||
| - | **Exam rules**: | ||
| - | |||
| - | ** Exam Results ** | ||
| - | * N/A | ||
| - | </WRAP> | ||
