LARA: Laboratory for Automated Reasoning and Analysis cc16
https://lara.epfl.ch/w/
2026-04-05T21:34:44+0200LARA: Laboratory for Automated Reasoning and Analysis
https://lara.epfl.ch/w/
https://lara.epfl.ch/w/lib/tpl/epflv2/images/favicon.icotext/html2016-09-22T17:23:56+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_01
https://lara.epfl.ch/w/cc16/labs_01?rev=1474557836&do=diff
Part 0: Lab Setup
Start by setting up your environment as described. Familiarize yourself with the Tool Programming Language and the Tool Compiler Project.
Part 1: Your first Tool programs
Write two example Tool programs each and make sure you can compile them using the Tool Reference Compiler. Please be creative when writing your programs. We don't need 5 versions of a program computing the Fibonacci sequence. The examples at the end of thetext/html2016-09-26T15:40:59+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_02
https://lara.epfl.ch/w/cc16/labs_02?rev=1474897259&do=diff
Labs 02: Lexer for Tool
This assignment is the first real part of the Tool compiler project. Make sure you have read the general project overview page first.
Code Stubs
Caution: We are no longer going to use the parser+trees given in lib/toolc-frontend_2.11-3.0.jar. This commit removes this file.text/html2016-10-12T11:20:31+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_03
https://lara.epfl.ch/w/cc16/labs_03?rev=1476264031&do=diff
Labs 03: Parser
Introduction
This week you will work on the second stage of the tool compiler, the parser. The task of the parser is to take a sequence of tokens produced by the lexer and transform them into an Abstract Syntax Tree (AST) of Tool.text/html2016-10-26T10:05:49+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_04
https://lara.epfl.ch/w/cc16/labs_04?rev=1477469149&do=diff
Labs 04: Name Analysis
This week you will add name analysis to your Tool compiler. This will considerably ease the task of type checking that you will start next week or the week after.
The description of this assignment is rather long. Don't panic :) Most of it is to help you avoid forgetting important points. Please read it carefully. The assignment itself is one of the longer ones, but you have three weeks to work on it, and we give you a substantial amount of code.text/html2016-11-30T00:36:08+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_05
https://lara.epfl.ch/w/cc16/labs_05?rev=1480462568&do=diff
Labs 05
This week you will implement type checking in your Tool compiler. After this step, you will have completed the front-end of your compiler. This means that it will be able to reject all invalid programs, and accept all valid programs. You will then be able to turn these valid inputs into assembly code that runs on the JVM, just liketext/html2016-11-30T09:36:53+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_06
https://lara.epfl.ch/w/cc16/labs_06?rev=1480495013&do=diff
Labs 06: Code Generation
Congratulations, your front-end is complete! You are now one step away from completing your compiler. The last step of the compiler is to generate binary code for the Java Virtual Machine. This week's lab description is short, buttext/html2016-12-07T11:03:11+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_07
https://lara.epfl.ch/w/cc16/labs_07?rev=1481104991&do=diff
Labs 07: Mini Project
This project has several deadlines to ensure that the project extension you pick is reasonable. Please read below.
You have now written a compiler for a simple language. The final mini-project is to design an implement a new functionality of your own choice. Typically you will extend the compiler you built so far with a new feature. In preparation for this, you should aim to learn about the problem domain by searching the appropriate literature. The mini project includes:text/html2016-09-20T17:23:15+0200Anonymous (anonymous@undisclosed.example.com)cc16:labs_setup
https://lara.epfl.ch/w/cc16/labs_setup?rev=1474384995&do=diff
Labs Setup
This page contains instructions on how to set up your computer such that you can:
* program your assignments,
* make sure you keep track of your work with a version control system,
* submit your labs for grading, and
* use our black-box testing system.text/html2016-10-25T16:25:50+0200Anonymous (anonymous@undisclosed.example.com)cc16:tool
https://lara.epfl.ch/w/cc16/tool?rev=1477405550&do=diff
Tool Resource Page
Tool stands for Toy Object-Oriented Language, and it is the programming language for which you will write a compiler in this course.
Some basic information for Tool:
* Tool is object oriented. It supports classes with inheritance and method overriding (but not overloading).text/html2016-09-13T14:37:06+0200Anonymous (anonymous@undisclosed.example.com)cc16:tool_compiler_project
https://lara.epfl.ch/w/cc16/tool_compiler_project?rev=1473770226&do=diff
The Tool Compiler Project
The main project in this course consists in implementing toolc, a compiler for a small, Java-like, object-oriented progamming language, which we call Tool. You will code all phases of a modern compiler, resulting in an implementation which will allow you to compile source files into Java Bytecode, in the same waytext/html2016-09-20T11:28:54+0200Anonymous (anonymous@undisclosed.example.com)cc16:tool_reference_compiler
https://lara.epfl.ch/w/cc16/tool_reference_compiler?rev=1474363734&do=diff
The Tool Reference Compiler
The latest version available is 3.0. You can obtain it from here: toolc-reference-3.0.jar.
You can run it as follows:
java -jar toolc-reference-3.0.jar program.tool
Available Options
By default, toolc just compiles a Tool program to bytecode like your implementation will. You can however also use the reference implementation for other things. Try to runtext/html2016-09-20T19:59:09+0200Anonymous (anonymous@undisclosed.example.com)cc16:toolprog-binarysearch.tool
https://lara.epfl.ch/w/cc16/toolprog-binarysearch.tool?rev=1474394349&do=diff
program BinarySearch {
println(new BS().Start(20));
}
// This class contains an array of integers and
// methods to initialize, print and search the array
// using Binary Search
class BS {
var number : Int[];
var size : Int;
// Invoke methods to initialize, print and search
// for elements on the array
def Start(sz : Int) : Int = {
do(this.Init(sz));
do(this.Print());
if (this.Search(8))
println(1);
else
println(0…text/html2016-09-20T19:57:30+0200Anonymous (anonymous@undisclosed.example.com)cc16:toolprog-factorial.tool
https://lara.epfl.ch/w/cc16/toolprog-factorial.tool?rev=1474394250&do=diff
program Factorial {
println(new Fact().computeFactorial(10));
}
class Fact {
def computeFactorial(num : Int) : Int = {
var num_aux : Int;
if (num < 1)
num_aux = 1;
else
num_aux = num * (this.computeFactorial(num - 1));
return num_aux;
}
}text/html2016-09-20T19:58:12+0200Anonymous (anonymous@undisclosed.example.com)cc16:toolprog-maze.tool
https://lara.epfl.ch/w/cc16/toolprog-maze.tool?rev=1474394292&do=diff
program Maze {
/* prints a maze of size 20x20 */
println(new MazeArray().init(20).printMaze());
}
class MazeArray {
var size : Int;
var prng : PseudoRandomNumberGenerator;
var walls : Int[];
var wallCount : Int;
var vertOffset : Int;
var wallIDs : Int[];
var cells : Int[];
var cellCount : Int;
var pipeChar : String;
var horzChar : String;
var plusChar : String;
var t1Char : String;
var t2Char : String;
var t3Char : String;
var t4Char : String;
var l1Ch…text/html2016-09-20T19:59:43+0200Anonymous (anonymous@undisclosed.example.com)cc16:toolprog-pi.tool
https://lara.epfl.ch/w/cc16/toolprog-pi.tool?rev=1474394383&do=diff
program Pi {
if(new Computer().computePi()) {
println("Ok");
} else {
println("error");
}
}
class Computer {
def computePi() : Bool = {
var j : Int;
var value : Frac;
var inter : Real;
println("First method");
println("************");
value = new Frac().init(0,1);
j = 0;
while(j < 3) {
println(value.toString() + " ~= " + new Real().init(0,10).evalFrac(value).toString());
val…text/html2016-09-20T20:00:18+0200Anonymous (anonymous@undisclosed.example.com)cc16:toolprog-quicksort.tool
https://lara.epfl.ch/w/cc16/toolprog-quicksort.tool?rev=1474394418&do=diff
program QuickSort {
println(new QS().Start(10));
}
// This class contains the array of integers and
// methods to initialize, print and sort the array
// using Quicksort
class QS {
var number : Int[];
var size : Int;
// Invoke the Initialization, Sort and Printing
// Methods
def Start(sz : Int) : Int = {
do(this.Init(sz));
do(this.Print());
println(9999);
do(this.Sort(0,size - 1));
do(this.Print());
return 9999;
}
…text/html2017-10-09T16:31:20+0200Anonymous (anonymous@undisclosed.example.com)cc16:top
https://lara.epfl.ch/w/cc16/top?rev=1507559480&do=diff
Computer Language Processing
CS-320, Edition 2016
Moodle Page
Staff
Instructor Viktor Kuncak PhD Assistants Manos Koukoutos and Ravi Kandhadai MSc Assistants Tristan Overney, Ogier Bouvier and Alfonso Peterssen Infrastructure advice Etienne Kneuss Secretary Sylvie Jankow
Grading
* 50% Projects
* 50% Quiz
Stuff: Course Materials