From Abstract Syntax Trees to Machine Code with LLVM
A compiler is a program that translates source code written in a particular language into another language, for instance from C to x86 machine code. Internally, the whole process is typically split into multiple phases that handle one particular aspect of this translation.Roughly speaking, one can distinguish three main phases: parsing, semantic analysis and code generation. The first phase typically consists of transforming the input into a tree-shaped representation of the program, to which the second phase assigns a meaning. The last phase consists of translating this intermediate representation into the output language.
In this session, we will focus on this last phase, and use LLVM to translate abstract syntax trees (ASTs) to executable code. LLVM is a compiler toolchain that handles code generation, while being agnostic to the input language. It is based on its own internal representation, LLVM IR, which is then transformed to machine code for a particular architecture. Our goal will be to translate a program expressed in the form of an AST into LLVM IR. This will challenge us to find and implement techniques to encode high-level language features, such as object-orientation, into a much more lower-level constructions
Mon 23 Mar Times are displayed in time zone: Greenwich Mean Time : Belfast change
|14:00 - 15:30|
|From Abstract Syntax Trees to Machine Code with LLVM|
Dimitri RacordonUniversity of Geneva, Centre Universitaire d'Informatique, Geneva, Switzerland