ASSIGNMENT

DRIVE SPRING 2020

PROGRAM Bachelor of Computer Application – BCA
SEMESTER 5
SUBJECT CODE & NAME BCA 5141 – COMPILER DESIGN
BK ID B1873
NUMBER OF ASSIGNMENTS, CREDITS & 2, 4 Credits, 30 marks each
MARKS

NOTE –THE ASSIGNMENT IS DIVIDED INTO 2 SETS. YOU HAVE TO ANSWER ALL QUESTIONS IN BOTH
SETS. AVERAGE OF BOTH ASSIGNMENTS SCORE SCORED BY YOU WILL BE CONSIDERED AS YOUR
INTERNAL ASSESSMENT (AI) SCORE. ANSWERS FOR 10 MARKS QUESTIONS CAN BE APPROXIMATELY OF
400 WORDS. EACH QUESTION IS FOLLOWED BY EVALUATION SCHEME.

Answer all questions

Q. No. Assignment Set -1 Marks Total
Questions Marks
1 (a) Describe Finite State machine. [5+5] 10
(b) Describe non-deterministic finite automaton (NFA).

2 Write down various LEX actions of LEX tool that can be used [10] 10
for ease of programming.
3 [5+5] 10
(a) Write down the principles upon which parsing
techniques are based.
(b) Write down basic steps of a bottom-up parser.

Q. No. Assignment Set -2 Marks Total

Questions Marks
1 What is translation scheme? Define S-attributed and L- [4+6] 10
attributed translation scheme.
2 Explain how Direct Acyclic Graph (DAG) is represented for [10] 10
Basic Blocks with example.
3 [5+5] 10
Describe static allocation during compile time. Also point
out its limitations.