This is an old revision of the document!
This lab is designed to transition our interpreter to a more powerful image processing engine, and to give you experience in creating new data types.
This lab builds on the previous interpreters. In addition, to support the image processing primitives and text rendering primitives, you will need to install the Cairo
and Images
packages into Julia. This is done using the Julia package management system:
Pkg.add(“Cairo”)
and
Pkg.add(“Images”)
Note: Julia uses Git as the foundation of their package management system. This can create problems if your system can't access Git using a git:
protocol – this is manifest by Julia hanging when trying to install packages. To alleviate this, please check out the following links:
https://github.com/JuliaLang/julia/issues/7005
https://github.com/JuliaLang/julia/blob/master/README.md#source-download-and-compilation
—-
====Deliverable:====
For this lab, you will expand the interpreter that you have already built, and add in a new “analysis” function that performs three different flavors of syntactic de-sugaring.
The primary deliverable for this lab is a new Julia module. Your module should export
parse,
calc and
NumValanalyze
functions, and two return types, and
ClosureVal.
Your module should be able to do everything that your simple interpreter could do and everything that your extended interpreter can do. However, you will use program analysis to both eliminate
With nodes, and to add two new simple features.
The
CI7.jl module is available on LearningSuite, under “Content → Julia → Program analysis”.
Please name your module TransInt.
—-
====Description:====
For this lab, you will implement an
analyze function similar to what we covered in class. The
analyze function accepts as input an AST, rewrites it, and returns a new AST.
There are three rewrites you must implement:
- You must rewrite multi-argument
with nodes to be multi-argument
lambda nodes.
- You must create a new multi-argument
+ operation that is implemented with only binary
+ operations.
- You must create a new multi-argument
and operation that is implemented with only
if0 operations.
Each is discussed in more detail in the following sections.
The grammar for our new language is the following:
<code BNF>
<OWL> ::= number
| (+ <OWL> <OWL> <OWL>*) # at least two parameters, possibly infinity. note extra star!
| (- <OWL> <OWL>)
| (* <OWL> <OWL>)
| (/ <OWL> <OWL>)
| (mod <OWL> <OWL>)
| (collatz <OWL>)
| (- <OWL>)
| id
| (if0 <OWL> <OWL> <OWL>)
| (with ( (id <OWL>)* ) <OWL>)
| (lambda (id*) <OWL>)
| (and <OWL> <OWL> <OWL>*) # new operation 'and'
| (<OWL> <OWL>*)
</code>
—-
===Expanded functionality:===
Here we discuss the three new features you must support in our language.
Part 1: Multi-site
withwith
→ multi-site lambda
In class we showed how to implement expressions using
lambda expressions, but only for
with and
lambda expressions that involve one parameter. For the first part of the lab, you must rewrite the AST of a program to eliminate all
with nodes, even with multiple parameters, and replace them with equivalent function creation / function calls.
Remember from class that
<code lisp>
(with (x 5) (+ x 1))
</code>
becomes
<code lisp>
1) 5)
</code>
Your code should make a similar transformation for multiple-identifier
with expressions to applying multiple-parameter
lambda expressions.
No changes to the grammar are necessary to support this change, and therefore, no changes to your parser from the Extended Interpreter are necessary to implement this under-the-hood syntactic rewrite. The transformation should happen in the
analyze function.
Part 2: Addition operation with arbitrary number of parameters
For the second feature, you must implement a more flexible
+ operator.
Specifically, instead of only two operands, the new
+ operator should support an arbitrary number of operands, as long as there are more than two.
However, this will be syntactic sugar – you should implement this using your existing binary operations.
So, we would essentially rewrite this:
<code lisp>
(+ a b c d)
</code>
into this:
<code lisp>
(+ a (+ b (+ c d)))
</code>
Note that this involves a change to the grammar, and therefore you will need to change your parser! You may need to change the definition of the plus node – it can no longer by implemented as a BinOp. The
analyze function should eventually convert it to a sequence of BinOp operations only, and your
calc function should handle this without change.
Part 3: A simple
andand
operator
For the final part of this lab you will implement a simple short-circuited operation in terms of
if0 calls. The semantics of the
and node is that it should return 1 iff all subexpressions evaluate to nonzero, and return 0 otherwise. Or in other words, it should return 0 if any subexpression evaluates to zero.
As an example, we will transform this:
<code lisp>
(and (+ 4 0) (- 3 3) (* 4 3))
</code>
into this:
<code lisp>
(if0 (+ 4 0)
0
(if0 (- 3 3)
0
(if0 (* 4 3)
0
1)))
</code>
Note that this is a new construct in our grammar, so you will need to create a new AST node type (call it
And) and parse it appropriately. However, because it is being implemented in terms of
if0 calls, you will not need to modify your
calc function to support it. The transformation from the
And node to the
if0 nodes should happen in the
analyze'' function.