ichalkias / cc-summer-2016 Goto Github PK

• Step 0: form a team of 2-3 members
• Step 1: give your team a name
• Step 2: get a github account for each member
• Step 3: one person per team forks the CC-Summer-2016 repository
• Step 4: add the other team members to your fork as collaborators
• Step 5: each team member clones that fork
• Step 6: check out the branch selfie-master
• Step 7: add a new file called TEAM to this branch
• Step 8: list the name of your team as well as your names in the TEAM file
• Step 9: implement solutions of assignments in this branch as well (see below)
• Step 10: commit regularly and push your changes to your fork
• Step 11: to submit solutions send pull requests from your fork via github.com to selfie-master

All homework solutions:

• must be implemented in C* in the selfie.c file,
• must compile without warnings with starc and execute with mipster,
• must not break any existing selfie functionality, and
• must be ready for presentation on your machine in class.

Deadline: March 10, 10am (hard, no extensions)

Suppose your team name is TheCompilables. Change selfie such that it prints "This is TheCompilables Selfie" in a separate line on the console before doing anything else. All other functionality should be unaffected.

Deadline: March 17, 10am (hard, no extensions)

Implement in mipster the four logical bitwise shift instructions of MIPS called sll, srl, sllv, and srlv according to the MIPS standard. In your implementation use the selfie library functions for bitwise shifting and the selfie interface functions for decoding. Also, make sure that the selfie disassembler and debugger produce proper output for these instructions.

Deadline: April 7, 10am (hard, no extensions)

Implement in starc scanning and parsing of the two bitwise shift operators of C written << and >>. Extend the scanner and parser of starc accordingly. In particular, invent unique tokens for the new symbols and make sure that the scanner properly distinguishes < from << and > from >>. Then, add a new production rule for the new symbols to the C* grammar (in the grammar.md file) such that their precedence is between + and < as specified for C operators. Finally, add a procedure for parsing the new symbols to starc according to the new production rule (hint: use a copy of the procedure for parsing simple expressions as template). Test your implementation on syntactically correct as well as syntactically incorrect C* programs using the two shift operators.

Deadline: April 14, 10am (hard, no extensions)

Implement in starc code generation for the shift operators << and >> of Assignment 2 using the logical bitwise shift instructions of Assignment 1. The semantics of both operators should be logical bitwise shift meaning that zeros are shifted in on either end (even for >> of negative numbers). Change the implementation of the leftShift and rightShift procedures using << and >> instead of * and / such that the original semantics of both procedures is preserved. Avoid calling the twoToThePowerOf procedure in your solution. Finally, demonstrate that self-compilation of selfie still works and check which procedures are now the most called procedures during self-compilation.

Deadline: April 28, 10am (hard, no extensions)

Implement constant folding in arithmetic expressions. For this purpose introduce a grammar attribute that represents the value of an expression if available. Use the attribute to evaluate constant expressions at compile time and delay code generation for arithmetic expressions accordingly. Represent the attribute by a call-by-reference parameter to the involved parsing procedures. The parameter needs to carry the value and a flag that indicates if a value is available. Use exactly one instance of the parameter for parsing an arithmetic expression. Test your code by including code snippets in main that are subject to constant folding. Also, make sure that self-compilation of selfie still works.

Deadline: May 4, 10am (hard, no extensions)

Implement one-dimensional arrays with support of constant folding in size and index expressions. As usual, extend the C* grammar first and then implement parsing and code generation. Focus on array access first. After that implement global and local declarations of one-dimensional array variables. Finally, implement one-dimensional array parameters. To test your code modify selfie such that the binary variable is declared and accessed as array.

Deadline: May 12, 10am (hard, no extensions)

Extend your implementation of one-dimensional arrays to two-dimensional arrays. To test your code modify selfie such that the binary and sourceLineNumber variables are represented by a single two-dimensional array.