Reg No.:_ Name:

Max. Marks: 100

1

2

3

4

5 a)
b)

6 a)
b)

7 2)
b)

F1031 Pages: 2

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SIXTH SEMESTER B.TECH DEGREE EXAMINATION(R&S), MAY 2019

Course Code: CS304
Course Name: COMPILER DESIGN

PARTA

Answer all questions, each carries3 marks.
Describe input buffering scheme in lexical analyzer.
Construct a regular expression to denote a language L over > = {0,1} accepting
all strings of 0’s and 1’s that do not contain substring 011
Consider the context free grammar S->aSbS | 6585 | ©
Check whether the grammar is ambiguous or not
What is Recursive Descent parsing? List the problems faced in designing such a

parser.

PART 13

Answer any two full questions, each carries9 marks.
Explain the different phases in the design of a compiler.
Find the FIRST and FOLLOW of the non-terminals in the grammar
S->aABe
A->Abc|b
B->d
Design a recursive descent parser for the grammar
E->E+T|T
T->T*F | F
F->(E) | id

Develop a lexical analyzer for the token identifier.

What is left recursive grammar? Give an example. What are the steps in
removing left recursion?

Explain any four compiler writing tools

Page 1 of 2

Duration: 3 Hours

Marks

(3)
(3)

(3)

(3)

(5)
(4)

(5)

(4)

(5)

(4)