Dear COMP3131/9102 Students,
The answer to this question should obviously be "false" not "true" as shown in the drafty answer sheet if you have downloaded it before 22 April.
Dear COMP3131/9102 Students,
Assignment 5 has been marked. Please let me know if you have any issues with your marks.
Dear COMP3131/9102 Students,
You can download a few past exam papers from our course page by clicking the "Exam" button on the left.
Dear COMP3131/9102 Students,
When translating a method in a VC program, your compiler will be required to generate a directive:
`.limit stack XXX`
Here, XXX indicates the size of the operand stack allocated by the JVM during the execution of the method.
Given that our VC compilers might produce a range of code sequences without focusing on optimisation, the stack size you calculate may differ from that determined by our reference solution.
This implies that you may select a different stack size as long as it meets the minimum requirements for your code sequence. Specifically, if the minimum required stack size for your code sequence is 10, any value for XXX less than 10 will cause your code to crash. On the other hand, setting XXX larger than 10 means your compiler is utilizing more memory than necessary. When marking this assignment, we will be lenient and not impose any penalties if XXX exceeds 10 by, for example, 1 or 2.
Dear COMP3131/9102 Students,
The tutorials we have tomorrow (11 April) will have to be done online. See below. Thanks for your understanding. --- Jingling
Hi Jingling,
I'm still having difficulty walking properly. Could you please inform the students that tomorrow's tutorials will also be conducted online?
They can use the same links as last week, which are provided below for your convenience:
Regards,
Samad
Dear COMP3131/9102 Students,
If you want to use a reference solution for the type checker in Assignment 5, you can download it according to the instructions given in the spec of Assignment 5.
Dear COMP3131/9102 Students,
Assignment 4 has been marked. Please check your marks.
Dear COMP3131/9102 Students,
The spec for Assignment 5 has just been released.
I will introduce a simple code generation technique that allows you to write a code generator for VC in Assignment 5.
Dear COMP3131/9102 Students,
Here are the same zoom links to be used for today's tutorials (as the tutor has twisted his ankle and won't be able to attend school today). Sorry for the late notice.
Tutorials:
Dear COMP3131/9102 Students,
I received the following message from the tutor, but I am still waiting for a zoom link.
Hi Jingling,
Could you please inform the students that tomorrow's tutorials (Thu 4th April) will be held online?
I've twisted my ankle and won't be able to attend school tomorrow.
Regards,
Samad
Dear COMP3131/9102 Students,
Hi Jingling,
The recording for wk7 has just been uploaded.
Here is the Zoom link for the makeup session scheduled for
Tuesday at 1pm
:
URL:
https://unsw.zoom.us/j/88114755200?pwd=L00vQ1JONndwVytMZGdVQ0tLUTlLdz09
Meeting ID: 88114755200
Meeting Passcode: 123456
Dear 3131/9102 Students,
The bonus assignment for this course has just been released.
Dear COMP3131/9102 Students,
Over the next two weeks, we will focus on code generation, aiming to assist you in developing a code generator for Assignment 5.
Dear COMP3131/9102 Students,
A reference solution for the parser developed for Assignment 3 is now available. If your parser is not fully operational and you prefer to use this reference solution for completing your final two assignments, you have the option to do so. You can download it as per the spec of Assignment 4.
The solution adheres strictly to the spec of Assignment 3, which means it lacks any extra features that might be present in your own parser solution but are not required by the spec.
Dear COMP3131/9102 Students,
Assignment 3 has been marked. Please check your marks and let me know if there are any issues with your marks.
Dear COMP3131/9102 Student,
The spec for Assignment 4 has been released. Today's lecture will focus on explaining how to implement a type checker for VC in Assignment 4.
Dear COMP3131/9102 Student,
The spec for Assignment 4 will be released tomorrow, just before our Friday lecture. As I mentioned in yesterday's lecture, the entire static analyzer component for VC comprises two subphases: identification and type checking. The identification subphase, which I introduced yesterday, has already been completed for you. In Assignment 4, your focus will be solely on implementing the type checking subphase. Your type checker will be a visitor that implements the Visitor interface. Since VC is relatively simple, the process of implementing a type checker will be straightforward conceptually, as will be explained in tomorrow's lecture.
Dear COMP3131/9102 Student,
Assignment 2 has been marked. Please review your marks and inform me of any discrepancies.
No reference solution will be provided for Assignment 2, as it signifies the first of two stages in the development of a parser for VC. You are now encouraged to enhance your recogniser to ultimately obtain a parser for VC in Assignment 3, which constitutes the second stage of this overarching assignment.
During today's lecture, we will begin delving into attribute grammars, laying the groundwork for Assignments 4 and 5.
Dear COMP3131/9012 Student,
The spec for Assignment 3 has just been released.
As described in the course outline, Assignments 2 and 3 are components of a singular assignment. Thus, the specification for Assignment 3 will be made available prior to the deadline for Assignment 2. This arrangement enables students who complete Assignment 2 ahead of schedule to commence work on Assignment 3 without delay. Moreover, reviewing the specification for Assignment 3 before attending tomorrow's lecture on writing a parser will improve your understanding
Dear COMP3131/9102 Student,
Unfortunately, the tutor has to conduct this Thursday's tutorials online again.
> Hi Jingling,
> I missed my BKK-SYD flight due to delays in my previous flights. > > Consequently, I'll need to conduct this Thursday's tutorials online as well. > I should be in Sydney by the weekend.
> Could you please inform the students about this?
> Regards,
> Samad
Please use the following zoom links that you used last week:
Tutorials:
Dear COMP3131/9102 Students,
If you still don't know how to check your marks, I have added some instructions at the beginning of our Assignment page.
Dear COMP3131/9102 Student,
If you want to use our reference scanner solution (available in class files), you can download it from the class account according to the spec for Assignment 2.
Dear COMP3131/9102 Student,
You may have already encountered the UID clash issue affecting our course account, which has unfortunately hindered our ability to submit assignments via command line. We are pleased to inform you that SS will be addressing this matter today between 12:30 PM and 1:30 PM. However, during this period, access to our class account will be temporarily unavailable.
We apologise for any inconvenience this may cause and appreciate your understanding as we work to resolve this issue promptly.
Thank you for your patience.
Dear COMP3131/9102 Student,
Assignment 1 has been marked. Please review your marks and inform me if you identify any discrepancies or issues with your assessment.
Please review the feedback provided on the course page.
Dear COMP3131/9102 Student,
The CSE servers are now operational!
In light of the CSE servers experiencing downtime shortly before 8 pm this past Friday, coinciding with the submission deadline for Assignment 1, I have decided to extend the deadline to 11 am on Sunday, February 25th. This adjustment is made to accommodate the unexpected technical difficulties and ensure all students have a fair opportunity to submit their work.
I was unable to make this announcement earlier because WebCMS was also down.
If you have previously submitted your scanner successfully, then you obviously don't have to do anything. No need to resubmit from webcms.
The issue with UID conflicts has been unpredictable.
Dear COMP3131/9012 Student,
Some of you might have experienced issues when attempting to submit your scanner via the command line using the following command:
% give cs3131 scanner Scanner.java
This issue stems from a UID conflict associated with the class account, an issue that the System Support Staff have been actively working to resolve for the past two weeks.
Please submit your scanner through webcms instead. Thank you.
I have just released the spec for implementing a recogniser in Assignment 2. I will discuss how to write a recogniser in today's lecture.
Dear COMP3131/9102 Student,
Please see this email from the tutor. You should be able to find the zoom link for tomorrow's session (F13) from the course page. If you cannot attend this tutorial, you can watch the tutorial recording later.
Hi Jingling,
Today, the first three sessions (i.e., Th9, Th10, and Th11) ran smoothly, but we experienced some connection issues in the last three sessions (i.e., Th12, Th13, and Th14).
Could you please inform the students who missed today's session that they can attend tomorrow's session at 13 (using the link for F13)?
Regards,
Samad
Dear COMP3131/9102 Students,
If you are registered for a Thursday tutorial, please be aware that the face-to-face (F2F) tutorials for Week 2 (THIS WEEK) ONLY will now be conducted online instead.
You can find the Zoom meeting links in the subsequent message from your tutor below. I apologise for any inconvenience this may cause.
--- Jingling
============== from the tutor ==============
Hi Jingling,
I regret to inform you that, due to unforeseen circumstances, I need to shift this Thursday 's tutorials to online (originally scheduled to be in-person).
I apologise for any inconvenience this may cause. Below are the Zoom links for the Thursday online sessions:
Tutorials:
Regards,
Samad
During the lecture after the mid-lecture break this past Friday, I demonstrated how to apply Thompson's algorithm for transforming a regular expression into an NFA using Screen 1, as this is the only one recorded. Meanwhile, I used Screen 2 to display Thompson's construction algorithm. This setup ensures that, when you watch the recording, you have the convenience of referring directly to Thompson's algorithm yourself from our lecture slides (Slides 96--97).
It is straightforward to know which of the rules (or cases) of Thompson's algorithm is used. For example, when constructing an NFA for the regular expression 0*, where r = 0 and the NFA for N(0) has already been constructed, the rule "RE r*" is applied. As another example, when constructing an NFA for the regular expression "10*", where r=1 and s=0*, and the NFAs for N(1) and N(0*) have been constructed, the rule "RE rs" is applied.
Today's lecture recording was cut off right as I was about to explain lookahead on Slide 54. I have made a previous recording available directly below today's lecture notes link. You can view those few minutes where I explain this slide.
Dear COMP3131/9102 Students,
The specification for Assignment 1 is now available, including the supporting code for this first assignment. You can download it following the instructions provided in the specification.
Dear COMP3131/9102 Students,
You can access the tutorial recordings by selecting "Tutorials" from the menu on the left.
If you are enrolled in one of the four online tutorials, you can locate your Zoom meeting links on our course page by selecting "Tutorials" from the left-hand menu.
If you previously experienced difficulties accessing our course webpage, please try to access it again. The issue should have been resolved by the school.
Dear COMP3131/9102 Student,
Welcome aboard!