User Tools

Site Tools


cs330_f2016:laby

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
cs330_f2016:laby [2018/09/26 17:55]
morse
cs330_f2016:laby [2021/06/30 23:42] (current)
Line 1: Line 1:
-** Temporarily under revision to fix errors -- don't use until completed and this message goes away. ** 
- 
 ** Make sure you are working with the latest versions of the class code compatible with Julia 1.0. ** ** Make sure you are working with the latest versions of the class code compatible with Julia 1.0. **
  
Line 11: Line 9:
  
 You will need to download and install [[https://​julialang.org|Julia]] for this lab. You will need to download and install [[https://​julialang.org|Julia]] for this lab.
-Note: if you are using Ubuntu, be careful using the ''​apt''​ version of Julia (it may be too old!). ​ **You should use Julia 1.0 or later.**.+Note: if you are using Ubuntu, be careful using the ''​apt''​ version of Julia (it may be too old!). ​ **You should use Julia 1.0 or later.**
  
 Note that the code required for this lab is available on LearningSuite,​ in the "​Content"​ section, under the "​Interpreters"​ subsection, on the page titled "Base Interpreter"​. ​ You will need the following files: Note that the code required for this lab is available on LearningSuite,​ in the "​Content"​ section, under the "​Interpreters"​ subsection, on the page titled "Base Interpreter"​. ​ You will need the following files:
Line 27: Line 25:
   * Your preferred text editor (look to see if it has Julia extensions) and command-line invocation of your programs, or   * Your preferred text editor (look to see if it has Julia extensions) and command-line invocation of your programs, or
   * Another IDE of your choice.   * Another IDE of your choice.
- 
-If you use Atom with Juno, I recommend looking at the ''​Revise''​ package in Julia, which you can install using Julia'​s package manager (''​Pkg''​ or using the Package Manager from within the Julia REPL.) 
  
 The instructor and TAs are prepared to help you with the first two (Juno and Jupyter), but you're on your own if you choose an arbitrary editor or IDE that we aren't familiar with. The instructor and TAs are prepared to help you with the first two (Juno and Jupyter), but you're on your own if you choose an arbitrary editor or IDE that we aren't familiar with.
Line 41: Line 37:
 Remember that you will use multiple dispatch to implement different "​versions"​ of ''​parse''​ and ''​calc'',​ based on the input type. Remember that you will use multiple dispatch to implement different "​versions"​ of ''​parse''​ and ''​calc'',​ based on the input type.
  
-An important difference between the code that you will implement for this lab, and the code we went through in class, is that your code should properly abstract multiple binary AST nodes into a single class we'll call ''​BinOp''​.+An important difference between the code that you will implement for this lab, and the code we went through in class, is that your code should properly abstract multiple binary AST nodes into a single class we'll call ''​BinopNode''​.
  
-Please name your module RudInt.+Please name your module RudInt ​and submit just the one file.
  
 ===Operator Table === ===Operator Table ===
  
-Define a data-structure to contain a mapping from operator symbols to the functions that actually implement that symbol.+Define a data structure to contain a mapping from operator symbols to the functions that actually implement that symbol. ​  
 +These functions can be either built-in ones or ones that you write, so long as you preserve the semantic meaning of the operation. 
 For example: For example:
  
Line 53: Line 51:
 Dict(:+ => +) Dict(:+ => +)
 </​code>​ </​code>​
 +
 +For operations that do not require any further semantic checking, you should map to the corresponding built-in function.
  
 ===Parser=== ===Parser===
Line 153: Line 153:
  
 <code julia> <code julia>
-using Revise+using Revise ​# make sure to load before the others
 using Error using Error
 using Lexer using Lexer
Line 161: Line 161:
 In order for your code to work with the solo-grader you will need to do following: In order for your code to work with the solo-grader you will need to do following:
   -Name your module ''​RudInt''​.   -Name your module ''​RudInt''​.
-  -Make sure the function stored in your binop are native Julia functions. 
   -Make sure the ''​julia''​ binary is in your executable path (like you did for ''​racket''​ previously)   -Make sure the ''​julia''​ binary is in your executable path (like you did for ''​racket''​ previously)
-  -Make sure the path for the Error and Lexer files are on you Julia path. To do this you can call ''​JULIA_LOAD_PATH=PATH python ....''​ or you can add ''​push!(LOAD_PATH,​pwd())''​ into your ''​.juliarc''​ file.+  -Make sure the path for the Error and Lexer files are on you Julia path. To do this you can add ''​push!(LOAD_PATH,​pwd())''​ into your ''​~/.julia/​config/​startup.jl''​ file, then just make sure to run the autograder from the same directory in which you have RudInt, Lexer, and Error.
   -Inside your module have the lines ''​using Error''​ and ''​using Lexer''​. ​ (These should already be in the base code we give you to start with.)   -Inside your module have the lines ''​using Error''​ and ''​using Lexer''​. ​ (These should already be in the base code we give you to start with.)
 +
 +====Change Log====
 +Changes since first given this semester:
 +  * Replaced "​type..."​ with "​struct..."​ in the abstract syntax definitions to be compatible with Julia 1.0
 +  * Changed "​Num"​ to "​NumNode"​ and "​Binop"​ to "​BinopNode"​ to be consistent with the in-class interpreters and the given base code in CI0.
 +  * Tweaked the Hints to be compatible with Julia 1.0, especially changing .juliarc to startup.jl.
 +  * Changed the autograders accordingly.
cs330_f2016/laby.1537984541.txt.gz · Last modified: 2021/06/30 23:40 (external edit)