Coder Social home page Coder Social logo

gboduljak / stanford-compilers-coursework Goto Github PK

View Code? Open in Web Editor NEW
44.0 3.0 28.0 6.85 MB

This is a repository of coursework project for the Stanford Compilers MOOC course. The result is a fully-working compiler for the COOL Programming Language.

Makefile 0.29% Cool 3.23% C++ 56.19% Lex 0.31% Perl 15.56% Shell 0.79% sed 0.02% Yacc 0.71% C 0.50% Assembly 22.40%
compilers compiler-construction cool cool-compiler mips

stanford-compilers-coursework's Introduction

Stanford Compilers Coursework (COOL Compiler)

Table of Contents

  1. Introduction
  2. Project structure
  3. Testing and grading
  4. Sample COOL Programs
  5. Setup & Reproduce
  6. Potential improvements

TLDR

If you are just looking for assignment implementations, see the project structure section.

Introduction

This is a repository of coursework assignments for the Stanford Compilers MOOC course. The result of completing all coursework assignments is a fully-working compiler for the COOL Programming Language. Compiler is written in C++ and depends on several assignment supplied libraries (like symbol table, identifiers table ...). Flex and Bison are used to implement first compiler frontend phases and other compiler passes are handcoded in C++.

The compiler compiles COOL into MIPS Assembly. MIPS is a reduced instruction set architecture about which you can learn more here. Resulting programs are run using SPIM simulator.

COOL (Classroom Object Oriented Language) is a computer programming language designed by Alexander Aiken for use in a compiler course taught at Stanford. COOL resembles many modern programming languages, including features such as objects, automatic memory management, strict static typing and simple reflection. COOL constructs take a few ideas taken from functional programming languages, so that every COOL statement is an expression which must return something.

COOL is precisely defined in specification documents, the most relevant ones are:

  • COOL Manual
    • describes lexical and syntactical structure of the language
    • describes type system rules (equations) and language operational semantics
  • COOL Runtime System
    • describes the runtime system backing this programming language
    • describes garbage collection algorithms used and the interface between those and a correct compiler
    • describes the object layout recommended to implement this language and the interface to the garbage collection routines

Here are a few examples of simple COOL programs:

Hello world

class Main inherits IO {
  main(): SELF_TYPE {
   out_string("Hello, World.\n")
  };
};

Palindrome checking program

class Main inherits IO {
   pal(s : String) : Bool {
       if s.length() = 0 
         then true
       else if s.length() = 1 
         then true
       else if s.substr(0, 1) = s.substr(s.length() - 1, 1) 
         then pal(s.substr(1, s.length() -2))
       else false
       fi fi fi
   };

   i : Int;

   main() : Object {
     {
         i <- ~1;
         out_string("enter a string\n");
         if pal(in_string())
             then out_string("that was a palindrome\n")
             else out_string("that was not a palindrome\n")
         fi;
     }
   };
};

Project Structure

The compiler project consists of four programming assignments:

  • Lexer - writing Flex specification which generates lexer
    • The input to the lexer is a string and the output is a stream of tokens
    • Here is the assignment specification
  • Parser - writing Bison specification which generates LALR(1) parser
    • The input to the parser is a stream of tokens and the output is an abstract syntax tree
    • The abstract syntax tree is constructed using a simple syntax directed translation
    • Here is the assignment specification
  • Semantic Analyser - writing a pass for semantical analysis, mainly type checking
    • The input to the semantic analyser is a raw abstract syntax tree and the output is the attributed abstract syntax tree
    • Here is the assignment specification
  • Treewalk Code Generator - writing a pass for code generation using a naive treewalk algorithm, generating code for the 'stack machine')
    • The input to the code generator is the attributed abstract syntax tree and the output is a file consisting of MIPS instructions
    • Here is the assignment specification

Testing and Grading

Most compiler phases are tested using the automated scripts which generate test cases and run each phase on the generated test cases. Almost all scripts were provided by the skeleton coursework project. All compiler phases are written and treated separately (ex: semantic analysis depends on the reference parser and lexer instead of ones written in this repository). This is to ensure that each phase generates only its own mistakes, since the mistakes made in previous phases could easily propagate in some later phase.

In the last phase (code generator), reference lexer, parser and semantic analyser are replaced by the ones written in this repository since they have shown 100% accuracy, so it was reasonable to treat them as correct, although it may be wrong. There were precisely 270 test cases across all phases. Complete testing report is available here.

To reproduce it, simply run run-all-phases-test.sh in the root of repository. This script should (re)compile all phases, test them separately and link them into a compiler which will be tested as a whole executable.

Sample COOL Programs

In the examples folder, there are various example COOL programs. All of them come in pairs ({name}.cl, {name}.s) where {name}.cl is a COOL program code, while {name}.s is the corresponding MIPS assembly program compiled using the written compiler (coolc in the root of the repository). Some of them are very simple and illustrate only key features of the COOL language, but there a few ones which are quite advanced (take a look at lam.cl which builds lambda calculus representation of a simple program and compiles it into Cool).

One of the 'graphical' ones is cells.cl which models one dimensional cellular automaton. cells.cl

All of these programs were provided in the skeleton course project. You can find more about them here.

Setup & Reproduce

Linux (Tested on Ubuntu 18)

This setup has been tested on Ubuntu 18, but I assume it should work on many distros with somewhat different package installations. The project depends on the reference COOL project and various tools. This setup is a variant of one discussed in the MOOC and the instructions written here originate from there.

(Optional) - Setup complete coursework environment

Use this setup variant if you want to run testing supplied in the coursework (dependes on specific spim installation and path)

  1. Install packages: sudo apt-get install flex bison build-essential csh libxaw7-dev
  2. Make the /usr/class directory: sudo mkdir /usr/class
  3. Adjust directory permissions: sudo chown $USER /usr/class
  4. Go to /usr/class and download the tarball
  5. Untar
    • tar -xf student-dist.tar.gz
  6. Add symlink to reference cool compiler stages
    • ln -s /usr/class/cs143/cool ~/cool
  7. Add the bin directory to the PATH environment variable
    • PATH=/usr/class/cs143/cool/bin:$PATH

Setup project

  1. Clone this repository
  2. Run compile-compiler.sh in the root of this repository
    • This script should build all compiler stages separately and link them
    • You should be able to run compiler using ./coolc in the root of this repository
  3. (Optionally) To ensure the compiler has been built successfully, execute run-all-phases-test.sh in the root of this repository
    • This script should test all compiler stages and output results similar to all-tests-output

macOS (Tested on Catalina)

This setup variant is equivalent to the Linux one without setting up coursework environment

Setup tools and dependencies

  1. Install g++, using brew you can run brew install g++
    • Ensure that g++-9 is available
  2. Install flex, using brew you can run brew install flex
    • Link this version of bison using brew link flex --force
      • You might need to add flex to PATH, possibly using something similar to echo 'export PATH="/usr/local/opt/flex/bin:$PATH"' >> ~/.zshrc
    • Ensure that running flex actually runs this flex (which flex should return /usr/local/opt/bison/bin/flex)
  3. Install bison, using brew you can run brew install bison
    • Link this version of bison using brew link bison --force
      • You might need to add bison to PATH, possibly using something similar to echo 'export PATH="/usr/local/opt/bison/bin:$PATH"' >> ~/.zshrc
    • Ensure that running bison actually runs this bison (which bison should return /usr/local/opt/bison/bin/bison)
  4. Install spim, using brew you can run brew install spim
    • cp trap.handler /usr/local/Cellar/spim/{spim-version}/share/exceptions.s (where {spim-version} should be replaced with installed spim version)

Setup project

  1. Clone this repository
  2. Replace Makefiles in each assignment folders (./assignments/PA2, ./assignments/PA3, ./assignments/PA4, ./assignments/PA5) with Makefile.mac makefiles
  3. Run compile-compiler.sh in the root of this repository
    • This script should build all compiler stages separately and link them
    • You should be able to run compiler using ./coolc in the root of this repository

Potential improvements

  • Refactor complete project
    • Since this project was built in several assignments, due to the skeleton project build process it was hard to reuse some logic (like traversing the class inheritance graph) so the complete implementation of this compiler consists of only 5 files mentioned in project structure section which sometimes duplicate logic from previous steps.
    • After some analysis, I have realised it might be a better idea to rewrite the compiler from scratch using more clear build process in a separate repository
  • Maybe compile to LLVM intermediate language to support more platforms out-of-the-box
    • This has been done by many people after completing this course

stanford-compilers-coursework's People

Contributors

gboduljak avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.