Compiler Design and Construction Question Banks - With Solution

Tribhuvan University

Institute of Science and Technology

2080

Bachelor Level / sixth-semester / Science

Computer Science and Information Technology( CSC365 )

Compiler Design and Construction

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

Time: 3 Hours

Candidates are required to give their answers in their own words as far as practicable.

The figures in the margin indicate full marks.

Section A

Attempt any two questions.

Differentiate between one-pass and multi-pass compiler. Construct the LL(1) parsing table for the following grammar.

S → ABCD

A → a | ε

B → b

C → 0 | ε

D → d | ε

How does Lexical Analyzer recognize a token? Give an example to make it clear. Convert the regular expression a(a+b)(b+c)^*a# to DFA.

Construct the LR(1) parsing table for the following grammar.

S → AaAb

A → BbBa

A → ε

B → ε

Section B

Attempt any eight questions.

Why code optimization is needed? Describe any two techniques for loop optimization.

What is three-address code? How high level code is converted to three address code? Illustrate with an example.

What is activation tree? Define type checking system with examples.

What are the advantages of intermediate code? What types of information are provided by symbol table?

What is annotated parse tree? Define S-attributed grammar with an example.

Describe about syntax directed translation with an example.

Given the following grammar with SLR parsing table, test whether the string “int * (int + int)” will be accepted or rejected.

E -> T + E……….(1)

E -> T……….(2)

T -> int*T……….(3)

T -> int……….(4)

T -> (E)……….(5)

How do you recognize basic block? Discuss about the factors that affect code generator.

Find the FIRST and FOLLOW of all the non terminals in following grammar.

S → aAbCD | ε

A → SD | ε

C → Sa

D → aBD | ε