Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 6 · TU Board 2081
Course Title: Compiler Design and Construction (CSC365)
Full Marks: 60Pass Marks: 24Time: 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.
Group A
Attempt any TWO questions.(2 × 20 = 40)
- 1.20
Give an example of reduce-reduce conflict. Construct the SLR parsing table for the following grammar.
E→ (L) | a
L → L, E | EAnswer comingAlso asked in 2081, 2080, 2076, 2075
- 2.20
What are the significances of intermediate code? Differentiate between DAG and Syntax tree. Represent the instruction A = B + C − D * E + G using quadruple and triple.
- 3.20
Illustrate the concept of backpatching with an example. Convert the regular expression a(a + b)a# to DFA.
Group B
Attempt any TWO questions.(2 × 10 = 20)
- 4.10
Explain different phases of compiler in brief.
- 5.10
What types of information are stored in a symbol table? Discuss the activation record.
- 6.10
Compute the FIRST and FOLLOW of the non-terminals in the following grammar:
S → (L) ∣ 1
L → LS ∣∗SAnswer comingAlso asked in 2081, 2080
- 7.10
Write the code generation algorithm for the instruction a = b op c.
- 8.10
Define core item. Compute the LR(1) item sets for the following grammar:
S → AA
A → aA ∣ bAnswer comingAlso asked in 2081
- 9.10
How do you represent recursion in an activation tree? Generate the three-address code for the following instruction:
n = (a + b) * (c - d);
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
x = n + i + j;
}
} - 10.10
What are the techniques for compiler optimization? Explain.
- 11.10
Describe the synthesized attribute and inherited attribute with an example.
Answer comingAlso asked in 2081
- 12.10
What is a type expression? List the properties of LL(1) grammar.
— The End —