Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
173 views3 pages

CS606 Spring 2023 Assignment 1

This document contains instructions for Assignment 1 for the course CS606 - Compiler Construction. It includes two questions worth 10 marks each. Question 1 asks students to draw a transition graph based on a given transition table for a non-deterministic finite automaton (NFA). Question 2 asks students to construct a transition table based on a given transition graph for an NFA. The document provides examples of the transition table and graph to help students answer the questions.

Uploaded by

Angel Of The Guardian
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
173 views3 pages

CS606 Spring 2023 Assignment 1

This document contains instructions for Assignment 1 for the course CS606 - Compiler Construction. It includes two questions worth 10 marks each. Question 1 asks students to draw a transition graph based on a given transition table for a non-deterministic finite automaton (NFA). Question 2 asks students to construct a transition table based on a given transition graph for an NFA. The document provides examples of the transition table and graph to help students answer the questions.

Uploaded by

Angel Of The Guardian
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

CS606 – Compiler Construction

Total Marks: 20
Assignment No. 01
Due Date: May 22, 2023
Semester: Spring 2023

BC190402167
Question # 1: Marks: 10

Draw a Transition Graph with the help of following Transition Table of a typical NFA.

a b ε
0 0, 1 4
1 2 0 3, 4
2 3 1, 2
3 3, 4 2
4 0 3, 4

Table: Transition Table of a typical NFA.

Solution:

1
CS606 – Compiler Construction
Total Marks: 20
Assignment No. 01
Due Date: May 22, 2023
Semester: Spring 2023

Question # 2: Marks: 10

Construct a Transition Table with the help of following Transition Graph of a typical NFA.

Fig. Transition Graph of a typical NFA

Note: In transition graph, ε represents epsilon (i.e., empty / null input).

Transition Table:

Solution:

a b ε
0 0 4 1
1 1, 4 3
2 2,4 0
3 4 3 2
4 2,0 1,3

Table: Transition Table of a typical NFA.

2
CS606 – Compiler Construction
Total Marks: 20
Assignment No. 01
Due Date: May 22, 2023
Semester: Spring 2023

You might also like