Dear COMP3131/9102 Students,
I have just released the specification for Assignment 3 (due on 18 March), a few days before Assignment 2 is due. There is some overlap between the two, as they are both part of the same overall assignment. Once you have implemented a parser in Assignment 3, the recogniser developed in Assignment 2 will no longer be used in future assignments. For this reason, no reference solution will be provided for Assignment 2.
In today’s lecture, I will cover how to write a parser for VC.
Dear COMP3131/9102 Students,
I have updated the last bullet point on Slide 217. Since you will have the opportunity to develop a top-down LL(1) parser, you are expected to have a general understanding of LL(k) grammars, at least for LL(1) and LL(2).
See the updated slide below:
Dear COMP3131/9102 Students,
If you haven't downloaded the starter code for Assignment 2, you can disregard this message.
Otherwise, please delete the extraneous keyword "throw" from line 210 of the code.
Dear COMP3131/9102 Students,
Assignment 1 has been marked. Please check your marks and let me know if you have any questions or concerns.
You can find the mark statistics and the test cases used on the course page.
Dear COMP3131/9102 Students,
The specification for Assignment 2 has just been released.
In today's lecture, we will look at how to build a predictive top-down recursive descent recogniser.
Dear COMP3131/9102 Students,
If you have an approved ELS (Equitable Learning Services) plan that includes extensions for programming assignments in this course, please contact me individually at least one week before each assignment deadline to discuss your extension request. This will allow me to configure the marking scripts correctly in advance.
Please note: This message is sent to all students as a general reminder. You should only contact me if this specifically applies to your circumstances.
Thanks.
Dear COMP3131/9102 Student,
In this algorithm, every intermediate NFA we construct has a single, unique accepting state. As demonstrated in yesterday's lecture, this accepting state is always the final state shown. This structure is crucial, as it ensures the correctness of the final NFA.
Dear COMP3131/9102 Students,
(1) Lecture recordings are available on Echo360, which can be accessed via Moodle.
(2) Additionally, the specification for Assignment 1 has been released.
Dear COMP3131/9102,
The spec for Assignment 1 has just been released.
Dear COMP3131/9102 Students,
Our lectures will be conducted in person, and recordings will be available on Echo360. If you miss a lecture, you can watch the recording there.
Dear COMP3131/9102 Students,
Welcome aboard!
Take a moment to review the course outline to get a clear overview of what to expect and how to make the most of this course.