https://github.com/notbobthebuilder/compiler-construction

stuff for the compiler construction module
https://github.com/notbobthebuilder/compiler-construction

Last synced: 7 days ago
JSON representation

stuff for the compiler construction module

• Host: GitHub
• URL: https://github.com/notbobthebuilder/compiler-construction
• Owner: NotBobTheBuilder
• Created: 2015-10-05T10:00:05.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2015-12-11T11:22:32.000Z (almost 9 years ago)
• Last Synced: 2024-04-14T18:06:01.719Z (7 months ago)
• Language: OCaml
• Size: 54.7 KB
• Stars: 1
• Watchers: 4
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Work for my Compiler Construction module @ UoB

[![Build Status](https://img.shields.io/travis/NotBobTheBuilder/compiler-construction.svg)](https://travis-ci.org/NotBobTheBuilder/compiler-construction)

Running

=======

Run `make` to install dependencies and generate `./main.native`, the main source file. From there you can run `./main.native` and manually enter programs, or you can pipe programs into it with `cat file.js | ./main.native`.

Run `./main.native -o` to enable optimisations, which will refactor the AST of the code you've pass in. Refer to `--help` for details on this and newer features

Running Tests

=============

`make test` builds and runs the tests. You can also see some results on the [Travis CI Build Matrix](https://travis-ci.org/NotBobTheBuilder/compiler-construction), which runs the tests on Mac and Linux across various common Ocaml versions.

What's implemented

==================

- Basic JavaScript assignment & operations

- Function definitions

- Function expressions

- Function calls

- Flow Control

- Comparisons

- Optimisations

A sample program:

    var a = 1;

    var b = 2;

    function add(x, y) {

      return x + y;

    };

    var mul = function(x, y) {

      return x * y;

    };

    var square = function(x) {

      return mul(x, x);

    };

    var imperativeCount = function(n) {

      if (n % 2 == 0) {

        a();

      } else {

        b();

      }

      while (n > 0) {

        alert(n);

        n = n - 1;

      }

    }

# Assembly Compilation

## TL;DR: Run `make sample` to build and run the file `something.js`

Currently compiles all expressions and some (but not all) variables - something weird going on with the stack.

- Scopes are now associated with functions and the program. A scope is currently a map of variable names to optionally inferred values

  - The size of the map bindings list determines how much space is allocated on the stack.

- Scopes are built during the optimiser stage and are only currently expanded by function parameters and `var x=..`

- Expression codegen is quite simple really, see `Asm.ml`

- Stack variables fully work to any size

- Constant propagation implemented

- if, if/else, and while loops (including constant-based branch elimination)

## Benchmarks

Running this code:

    var a = 1;

    for (var i = 0; i < 10000; i = i + 1) {

        for (var j = 0; j < 10000; j = j + 1) {

            a = a+1;

        }

    }

    

    a;

I got these results:

    === Node.js ===

    time (node something.js || echo)

    

    real    0m0.135s

    user    0m0.125s

    sys 0m0.008s

    === Mine ===

    time (./a.out || echo)

    

    

    real    0m0.005s

    user    0m0.001s

    sys 0m0.001s