Languages and translators

linfo2132  2022-2023  Louvain-la-Neuve

Languages and translators
6.00 credits
30.0 h + 30.0 h
Q2
Teacher(s)
Sadre Ramin;
Language
Main themes
  • Methods to analyze context-free languages, upstream and downstream methods
  • Generators of lexical analyzers and parsers
  • Statistical semantics and attributed grammars
  • Methods to translate a source code in a target code, and generation of target code
  • Machine virtuelle et byte-code (JVM)
  • Garbage Collection et gestion mémoire
  • Domain Specific Languages (DSL)
Learning outcomes

At the end of this learning unit, the student is able to :

1 Given the learning outcomes of the "Master in Computer Science and Engineering" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
  • INFO1.1-3
  • INFO2.2-4
  • INFO5.2, INFO5.4, INFO5.5
  • INFO6.1, INFO6.4
Given the learning outcomes of the "Master [120] in Computer Science" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
  • SINF1.M2
  • SINF2.2-4
  • SINF5.2, SINF5.4, SINF5.5
  • SINF6.1, SINF6.4
Given the learning outcomes of the "Master [60] in Computer Science" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
  • 1SINF1.M2
  • 1SINF2.2-4
  • 1SINF5.2, 1SINF5.4, 1SINF5.5
  • 1SINF6.1, 1SINF6.4
Students completing successfully this course will be able to
  • explain in a practical way the structure of compilers dealing with algorithmic languages
  • design and implement a compiler for a practical language which solves a interesting problem
  • show the interest of compiling techniques in problem resolving
Students will have developed skills and operational methodology. In particular, they have developed their ability to
  • treat rigorously a problem, justifying and validating each step of a project to be able to rely on it to implement the following one
  • explain in practical terms how a source code (Java) is finally translated into byte-code.
  • explain the enforcement mechanisms byte code by JVM
  • explain memory management during the execution of a program
  • explain how garbage collection mechanisms
 
Content
The course presents the theory and practice of programming language implementation, as well as compiler architecture. We will review the standard components of a compiler, from front-end (parsing, lexical analysis) to back-end (machine code generation, or interpreters), also touching on static semantics and type systems. Ultimately, students should be able to understand the ins and outs of the various programming language implementation techniques in use today.
During the course, the students will implement their own programming language.
Teaching methods
The course consists in a series of pre-recorded video lectures, as well as weekly or bi-weekly consolidation or lecture sessions. There will also be a couple of lab sessions to best prepare the students for the project.

During the semester, students will have to complete the project, which consists of extending a basic programming language interpreter/compiler with new paradigms.
Evaluation methods
June session:
The evaluation consists of two components: The project (done in groups) accounts for 60% of the course's final grade. A written exam accounts for 40%.
August session:
If the student did not successfully pass the course in the first session (i.e., they did not obtained at least 10/20 for the final grade), the student is allowed to redo those components (project or exam or both) of the evaluation for which they did not obtain at least 50% of the respective points. They will keep the points for the component that they passed (if any). The same weights as in the June session are applied for the calculation of the final grade.
Both sessions: The professor may request a student to go through an additional oral exam as a complement of the exam and/or of the project activities, in cases including, but not limited to, technical issues, or suspicion of irregularities.
Other information
Background :
  • LINGI1122 : Program design
  • LSINF1121 : High-level programming language, algorithmics and data structures
  • LINGI1101 : Logic and discrete structures
Online resources
Teams and/or Moodle
Bibliography
Ouvrage(s) recommandé(s) :
  • Crafting Interpreters, Bob Nystrom (https://craftinginterpreters.com/)
  • How To Create Pragmatic Lightweight Languages, Federico Tomassetti
  • Introduction to Compiler Construction in a Java World, Bill Campbell, Swamilyer, Bahar Akbal-Deliba
  • Modern Compiler Implementation in Jaav, Andrew W. Appel
Faculty or entity
INFO


Programmes / formations proposant cette unité d'enseignement (UE)

Title of the programme
Sigle
Credits
Prerequisites
Learning outcomes
Master [120] in Computer Science and Engineering

Master [120] in Computer Science

Master [60] in Computer Science