Due 11:59PM Friday March 2
Solution can be downloaded here
Your task in this assignment is to implement a compiler phase for the CPS value representation transformation, including closure conversion. In the skeleton code, you will find a template for this compiler phase in class miniscala.CPSValueRepresenter. You can (and are encouraged to) use the helper methods in class CPSValueRepresenter, CPSTreeModule.Tree, and object BitTwiddling. Please note that the the following aspects will be taken into consideration while grading:
For instance, transforming a primitive operation x op y by naively decoding the arguments (x,y) and encoding the result back will fetch you fewer points if there exists a better translation that avoids, either completely or partially, some encodings/decodings. Note: To that end, make sure to use left shift ( << ) and right shift ( >> ) operations to implement multiplication and division by 2 as described in the lectures.
For the closure conversion part, you can choose to implement either the "simple" or the optimized version. Correctly implementing the simplified one will give you 90% of the grade for this assignment, whereas a correct implementation of the optimized transformation will give you 110% of the grade. An optimized version that works without supporting recursive/mutually recursive calls will give you 100% (you can still have function calls if they are not recursive). The extra 10% will be given if recursive and mutually recursive function calls can be handled properly.
Notice, however, that by submitting an incorrect version of the optimized transformation you may lose a lot of points depending on the mistakes. Therefore, we recommend that you start by implementing the basic closure conversion procedure and, if you are successful and still have time, to extend it to the optimized procedure.
NOTE: many functions have an implicit argument worker. This argument should not be useful in the non-optimized version, therefore you are free to pass the value Map.empty to a function call.
The value representation phase of the MiniScala compiler takes as input a CPS program where all values and primitives are "high-level," in that they have the semantics which the MiniScala language gives them. It produces a "low-level" version of that program as output, in which all values are either integers or pointers and primitives correspond directly to instructions of a typical microprocessor.
This means that the primitive operations used in the CPSLow code (defined in CPSPrimitives) are only executing operations on integers (or pointers for block operations). All primitives are performing the operation that you could be expecting based on the name. Note that the CPSByteWrite primitive returns the value 0. You can checkout the CPSLowInterpreter in the CPSInterpreter.scala file and make sure you understand the CPSLow semantics.
From this assignment on, you will choose the shapes for the trees you generate. You should inspect them visually and decide whether or not they are correct and optimal. The application in the given skeleton code will not have whitebox tests, but it will still have an extensive blackbox test suite to ensure the correctness of the programs you generate.
Although we will not test tree shapes, we still encourage you to do so for every transformation rule you write. You have the necessary infrastructure in miniscala.test.CPSValueRepresentation_Whitebox so it's a matter of just writing the source code and the resulting tree. It is usually an effort that pays off.
The skeleton code for the assignment is available here.
This assignment relies on the correct implementation of the previous one (the CMScalaToCPSTranslator class). If you are confident that your implementation of CMScalaToCPSTranslator is correct, feel free to use your implementation. You are also free to use the reference implementation that is part of the skeleton for Project 5.
The project is due by March 2, 11:59PM. To turn in your project, go to the same directory that your proj5 directory lives in (you do not have to name it proj5, but it must contain all of the project files) and type:
turnin -c cs352 -p proj5 proj5
You can verify the status of your turned in project by running:
turnin -c cs352 -p proj5 -v