0% found this document useful (0 votes)
18 views2 pages

Compiler Design

This document outlines the IAT-1 examination for the Compiler Design course (CS8602) at Jayam College of Engineering and Technology. It includes details about the exam structure, with Part A consisting of short answer questions, Part B focusing on descriptive questions related to compiler phases and techniques, and Part C involving algorithmic tasks. The total marks for the exam are 50, and the duration is 1 hour and 30 minutes.

Uploaded by

kapilperumal000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views2 pages

Compiler Design

This document outlines the IAT-1 examination for the Compiler Design course (CS8602) at Jayam College of Engineering and Technology. It includes details about the exam structure, with Part A consisting of short answer questions, Part B focusing on descriptive questions related to compiler phases and techniques, and Part C involving algorithmic tasks. The total marks for the exam are 50, and the duration is 1 hour and 30 minutes.

Uploaded by

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

JAYAM COLLEGE OF ENGINEERING AND TECHNOLOGY

(Approved by AICTE & Affiliated to ANNA University, Chennai)


Dharmapuri – 636 813
IAT -1

CS8602-COMPILER DESIGN
Marks : 50
YEAR/SEM:3/6
Duration : 1:30 min

PART – A Marks-5*2=10

1 .Define token.

2 .what are the cousins compiler?.

3 .what are the main two part of compiler?.

4 state some compiler construction tools?.

5 .whats finite automata?

PART-B

6 .Describle the various phases of compiler with suitable example . (13)

7.a.Describes the input buffering techinqes in details(7)

b.the conversion of regular expression to DFA(00+11)*(01+!)*(6)

OR

a .how lexical analyzer can structed using LEX?give an Example?(13)

PART-C

8 .Using the algorithm minimize the following DFA.(14)


ALL THE BEST

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy