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

ACD-R20(DEC 2022)

This document is an examination paper for the Automata and Compiler Design course at Malla Reddy College of Engineering & Technology. It consists of five sections with questions covering topics such as DFA construction, context-free grammar, compiler phases, Chomsky hierarchy, and code generation. Students are required to answer five questions, choosing one from each section, with each question carrying 14 marks.
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)
12 views2 pages

ACD-R20(DEC 2022)

This document is an examination paper for the Automata and Compiler Design course at Malla Reddy College of Engineering & Technology. It consists of five sections with questions covering topics such as DFA construction, context-free grammar, compiler phases, Chomsky hierarchy, and code generation. Students are required to answer five questions, choosing one from each section, with each question carrying 14 marks.
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

Code No: R20A1202

R20
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Regular Examinations, December 2022
Automata and Compiler Design
(CSE-CS & CSE-DS)
Roll No

Time: 3 hours Max. Marks: 70


Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE
Question from each SECTION and each Question carries 14 marks.
***
SECTION-I
1 A Construct a DFA for the regular expression (0+1)*(00+11)(0+1)* [7M]
B Consider the given below CFG for arithmetic expressions. [7M]
E→E+E
E→E-E
E→E*E
E→E|E
E → id
Obtain the string id+id*id using leftmost and rightmost derivations?
OR
2 A Construct an equivalent DFA for the given NFA. [7M]

B Define Context Free grammar formally with an example and derivations [7M]
using a grammar.
SECTION-II
3 A What are the different phases of the compiler? Explain with the block [7M]
diagram?
B Differentiate Synthesized and Inherited attributes with example. [7M]
OR
4 A Explain YACC with an example program? [7M]
B Consider the following grammar: [7M]
D →TL
T → int |float
L →L, id |id
Write the Syntax Directed Definitions (SDD) to add the type of each
identifier to its entry in the symbol table during semantic analysis?
SECTION-III
5 A Explain the Chomsky hierarchy of languages and recognizers. [7M]
B Explain overloading of functions and operations with examples. [7M]

OR

Page 1 of 2
R20

6 A What is an abstract syntax tree? Explain with an example? [7M]


B Explain the Type checking and type conversions. [7M]
SECTION-IV
7 A Explain various storage allocation strategies with an example. [7M]
B Explain various techniques of peephole optimization. [7M]
OR
8 A Explain the scope access to now local names with an example. [7M]
B Explain the Principal sources of code optimization. [7M]
SECTION-V
9 A Describe the issues and object code forms of code generation. [7M]
B Explain DAG representation of Block with an example. [7M]
OR
10 A Write the steps in Generic code generation algorithm. [7M]
B Describe the importance of Register allocation and assignment. [7M]
****

Page 2 of 2

You might also like