Skip to content
VUBuddy

CS606 Assignment 1 Solution Spring 2026

Compiler Construction Lesson 16: LL Parsing 20 marks Solution updated 17 Nov 2026

About CS606 Assignment 1

CS606 Assignment No 1 for Spring 2026 is from Compiler Construction. It covers lesson 16: LL Parsing, 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
Spring 2026
Lesson
16: LL Parsing
Total marks
20
End date
Sun 22 Nov, 11:59 pm

What CS606 Assignment 1 asks

This assignment covers lexical analysis and syntax analysis for two different systems. For MediTrack, you will convert an NFA into a DFA for a sample ID token language, minimize the resulting DFA, and trace a character stream. For SkyDrop, you will analyze a grammar for a drone-delivery language called RouteQ. You must resolve left recursion, compute parsing sets, and evaluate the LL(1) property of the grammar.

  1. Question 1, Task 1

    5 marks

    Apply the subset construction algorithm to the provided NFA for the SID token. Name the DFA states D0, D1, D2, etc., in the order they are discovered, processing L before D. You must list the NFA states represented by each DFA state, provide the complete transition table, and identify the start and accepting states.

  2. Question 1, Task 2

    2 marks

    Minimize 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, Task 3

    3 marks

    Trace the character stream QZ9X using the DFA from Task 1. State the token returned by the scanner based on the longest match rule and indicate if any lexical error occurs.

  4. Question 2, Task 1

    3 marks

    Explain why the 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, Task 2

    4 marks

    Calculate the FIRST and FOLLOW sets for the non-terminals Route, Route', Leg, and Alt based on your rewritten grammar.

  6. Question 2, Task 3

    3 marks

    Determine 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 Left recursion removal FIRST and FOLLOW sets LL(1) grammar analysis

A summary of the assignment file, Fall 2026_CS606_1.docx. Download the file for the full wording before you start.

Lesson covered

Lesson 16: LL Parsing CS606 · Compiler Construction

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 17 Nov 2026. It answers the questions in the assignment file, Fall 2026_CS606_1.docx.

CS606_Assignment_1_Solution_2026.docx 114 KBAdded 17 Nov 2026Prepared by Musab Sultan
Solved it yourself? Share your solution with other CS606 students. We check it before it goes up here.
Submit your solution

Before you submit on VULMS

  1. 1 Solve the questions in the assignment file yourself first, then use the solution to check your method and answers.
  2. 2 Write the final answer in your own words. VU checks assignments for copying, and copied work gets zero marks.
  3. 3 Save your answer in the file type the assignment file asks for, and name it with your student ID, for example BC260012345.
  4. 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.

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.