You may complete this assignment in OCaml, Python, JavaScript, Haskell or Ruby.
You may work in a team of up to four people for this assignment. You may work in a team for any or all subsequent programming assignments. You do not need to keep the same teammates. The course staff are not responsible for finding you a willing team.
For this assignment you will write a semantic analyzer. Among other things, this involves traversing the abstract syntax tree and the class hierarchy. You will reject all Cool programs that do not comply with the Cool type system.
You will also write additional code to deserialize the AST produced by the parser stage and to serialize the class map, implementation map, parent map, and annotated AST produced by your semantic analysis.
You must create three artifacts:
To report an error, write the string
to standard output and terminate the program. You may write whatever you want in the message, but it should be fairly indicative. Example erroneous input:
Example error report output:
The typing rules do not directly specify the line numbers on which errors are to be reported. As of v1.11, the Cool reference compiler uses these guidelines (possibly surprising ones are italicized):
Remember that you do not have to match the English prose of the reference compiler's error messages at all. You just have to get the line number right.
Semantic checks are unordered — if a program contains two or more errors, you may indicate whichever you like. You can infer from this that all of our test cases will contain at most one error.
If there are no errors in file.cl-ast your program should create file.cl-type and serialize the class map, implementation map, parent map, and annotated AST to it.
The class and implementation maps are described in the Cool Reference Manual.
A .cl-type file consists of four sections:
Simply output the four sections in order, one after the other.
We will now describe exactly what to output for the class and implementation maps. The general idea and notation (one string per line, recursive descent) are the same as in PA3.
Note that you must output information about all classes and methods defined in the program as well as all base classes (and their methods). Do not just print out "classes actually used" or "methods actually called" or something like that. Output all classes and methods — no optimizations or shortcuts!
Now that we've formally defined the output specification, we can present a worked example. Here's the example input we will consider:
Resulting .cl-type class map output with comments:
.cl-type class map
comment
class_map
6 number of classes
Bool note: includes predefined base
classes
0
IO
0
Int
0
Main
1 our Main has 1 attribute
initializer
my_attribute named "my_attribute"
Int with type Int
2 initializer expression line number
Int initializer expression type (see
above: this is an expression annotated with a type)
-- do not emit these expression type annotations for the PA4c Checkpoint!
integer initializer expression kind
5 which integer constant is it?
Object
0
String
0
Resulting .cl-type implementation map output with comments:
.cl-type implementation map
comment
implementation_map
6 six classes
Bool first is Bool
3 - it has three methods
abort - first is abort()
0 -- abort has 0 formal arguments
Object -- name of parent class from
which Bool inherits abort()
0 -- abort's body expression starts
on line 0
Object -- abort's body expression
has type Object
internal -- abort's body is
an internal kind of expression (i.e., a system call; see above)
Object.abort -- extra detail on
abort's body expression
copy - second of Bool's three
methods is copy()
0 -- copy has 0 formal arguments
Object -- name of parent class from
which Bool inherits copy()
0 -- copy's body expression starts
on line 0
SELF_TYPE -- copy's body
expression has type SELF_TYPE
internal -- copy's body is
an internal kind of expression (i.e., a system call; see above)
Object.copy -- extra detail on
copy's body expression
... many lines skipped ...
Main another class is Main
8 - it has 8 methods
... many lines skipped ...
main - one of Main's methods is
main()
0 -- main has 0 formal arguments
Main -- the name of the class where
Main.main() is defined
4 -- the body expression of Main.main starts on line 4
SELF_TYPE -- the body expression
of Main.main has type SELF_TYPE
self_dispatch -- the body
of Main.main() is a self_dispatch kind of expression
... many lines skipped ...
Finally, the resulting .cl-type parent map output with comments:
.cl-type parent map | comment |
---|---|
parent_map | |
5 | there are five classes with parents (Object is the sixth class) |
Bool | Bool's parent ... |
Object | ... is Object. |
IO | IO's parent ... |
Object | ... is Object. |
Int | Int's parent ... |
Object | ... is Object. |
Main | Main's parent ... |
IO | ... is IO. |
String | String's parent ... |
Object | ... is Object. |
Writing the rote code to output a .cl-type text file given an AST may take a bit of time but it should not be difficult; our reference implementation does it in 35 lines and cleaves closely to the structure given above. Reading in the AST is similarly straightforward; our reference implementation does it in 171 lines.
You can do basic testing as follows:
You should implement all of the typing rules in the Cool Reference Manual. There are also a number of other rules and corner cases you have to check (e.g., no class can inherit from Int, you cannot redefine a class, you cannot have an attribute named self, etc.). They are sprinkled throughout the manual. Check everything you possibly can.
NOTE: Some of these video guides are from a previous offering of a similar course at the University of Virginia. The assignment for this semester has changed slightly. While they are still relevant, you are responsible for completing the assignment according to this course's grading rubric.
A number of Video Guides are provided to help you get started on this assignment on your own. The Video Guides are walkthroughs in which the instructor manually completes and narrates, in real time, the first part of this assignment — including a submission to the grading server. They include coding, testing and debugging elements.
If you are still stuck, you can post on the forum, approach the TAs, or approach the professor. The use of online instructional content outside of class weakly approximates a flipped classroom model. Click on a video guide to begin, at which point you can watch it fullscreen or via Youtube if desired.
PA4c is a checkpoint for PA4 to encourage you to start early.
For PA4c you should turn in (electronically) an early version of PA4 that does the following:
Thus you should build the class hierarchy and check everything related to that. For example:
You must turn in a zip file containing these files:
Your zip file may also contain:
You must turn in a zip file containing these files:
PA4 Grading (out of 100 points):