About CS606 Assignment 1
CS606 Assignment No 1 for Fall 2026 is from Compiler Construction. It covers lesson 36: More on File and Directory Attributes, carries 20 marks and is due on VULMS by 11:59 pm on Sunday 22 November 2026. The solution is on this page, with the assignment file.
- Course
- CS606 Compiler Construction
- Assignment
- Assignment No 1
- Semester
- Fall 2026
- Lesson
- 36: More on File and Directory Attributes
- Total marks
- 20
- End date
- Sun 22 Nov, 11:59 pm
What CS606 Assignment 1 asks
This assignment focuses on compiler construction concepts, specifically lexical analysis and syntax analysis. Students will work with two scenarios: MediTrack, a hospital lab-automation company, and SkyDrop, a drone-delivery startup. For MediTrack, the task involves converting an NFA to a DFA and minimizing it for a token-matching scanner. For SkyDrop, the task requires modifying a grammar for a recursive-descent parser and performing LL(1) analysis.
-
1
Question 1: NFA to DFA
5 marksApply the subset construction algorithm to the provided NFA for the Sample ID token. Name DFA states D0, D1, D2, etc., in the order they are discovered, processing L before D, and use Φ for the dead state. Provide the set of NFA states for each DFA state, the complete transition table, and identify start and accepting states.
-
2
Question 1: DFA Minimization
2 marksMinimize the DFA generated in the previous task by grouping equivalent states. Present the final groups and the resulting minimized transition table, ensuring the dead state Φ is included.
-
3
Question 1: Token Tracing
3 marksTrace the character stream QZ9X using the DFA from the first task. State the token returned by the scanner based on the longest match rule and indicate if any lexical error occurs.
-
4
Question 2: Grammar Modification
3 marksExplain why the provided grammar G1 causes a recursive-descent parser to run forever. Rewrite the grammar to eliminate this issue using a new non-terminal Route' while preserving the original language.
-
5
Question 2: FIRST and FOLLOW Sets
4 marksCalculate the FIRST and FOLLOW sets for the non-terminals Route, Route', Leg, and Alt based on the rewritten grammar.
-
6
Question 2: LL(1) Analysis
3 marksDetermine if the rewritten grammar is LL(1) using FIRST+ sets. Then, update the grammar with the production Alt → then hover num, recompute the FIRST+ sets for all Alt alternatives, and justify whether the grammar remains LL(1) by identifying any conflicting tokens.
- What to submit
- One .doc or .docx file.
- Topics covered
- NFA to DFA conversion DFA minimization Lexical analysis Recursive-descent parsing Grammar transformation FIRST and FOLLOW sets LL(1) parsing
A summary of the assignment file, Fall 2026_CS606_1.docx. Download the file for the full wording before you start.
Lesson covered
The questions in this assignment come from this lesson. Read it in the CS606 handout before you open the assignment file, then practise it with the MCQs and past papers.
Solution
The solution for CS606 Assignment No 1 was added on 16 Nov 2026. It answers the questions in the assignment file, Fall 2026_CS606_1.docx.
Before you submit on VULMS
- 1 Solve the questions in the assignment file yourself first, then use the solution to check your method and answers.
- 2 Write the final answer in your own words. VU checks assignments for copying, and copied work gets zero marks.
- 3 Save your answer in the file type the assignment file asks for, and name it with your student ID, for example BC260012345.
- 4 Open the file once more to check it is not empty or corrupted, then upload it on VULMS before 11:59 pm on Sun 22 Nov.
Questions about this assignment
When is CS606 Assignment 1 due?
Sunday 22 November 2026 at 11:59 pm. VULMS does not accept files after the deadline.
Is the CS606 Assignment 1 solution free?
The assignment file is free with no limit. The solution counts toward your daily downloads: 3 a day on the web, 30 a day with the free Chrome extension, 100 a day with Pro Semester and unlimited in the Android app.
Can I submit the solution as it is?
No. VU checks assignments for copying, and copied work gets zero marks. Use the solution to check your method, then write your own answer.
What file do I submit?
The assignment file says which file type to upload and lists any extra instructions from your instructor. Name the file with your student ID before you upload it on VULMS.