Are you eagerly searching for CS2352 Principles of Compiler Design important questions? Find out more important questions of this subject, CS2352 Principles of Compiler Design, here under. Collect it in text form. This subject is in the syllabus of Regulation 2008 for B.E CSE Anna University and its affiliated college students.
Anna University Chennai
Department of B.E CSE
Sixth Semester
CS2352 Principles of Compiler Design
November / December 2015 Exam Important Questions
(Regulation 2008)
IUQP Important Questions
Anna University, Chennai
Department of B.E CSE
B.E / B.TECH DEGREE EXAMINATION Nov / Dec 2015
SIXTH SEMESTER
CS2352 Principles of Compiler Design
(REGULATION 2008)
1. (i) What are the various phases of the compiler? Explain each phase in detail.
(ii) Briefly explain the compiler construction tools.
2. (i) Explain briefly about input buffering in reading the source program for finding the tokens. (8)
(ii) Construct the minimized DFA for the regular expression
(O+l)*[0+1) 10. (8)
3. (a) (i) Describe the various phases of complier and trace the program segment 4 : * + = c b a for all
phases. (10)
(ii) Explain in detail about compiler construction tools. (6)
4. (i) What are the issues in lexical analysis?
(ii) Elaborate in detail the recognition of tokens
5. (i) Explain the details about the specification of a simple type checker
(ii) How to sub-divide a run-time memory into code and data areas. Explain
6. Construct a canonical parsing table for the grammar given below:
E -> E + T, E -> T, T -> T * F, T -> F, F -> (E), F -> id
7. What are the different storage allocation strategies ? Explain (16)
8. (i) Distinguish between the source text of a procedure and its activation at run time. (8)
(ii) Discuss the various storage allocation strategies in detail. (8)
9. (i) Define three-address code. Describe the various methods of implementing three address
statements with an example. (8)
(ii) Give the translation scheme for converting the assignments into three address code. (8)
10. (i) How can Back patching be used to generate code for Boolean expressions and flow of control statements? (10)
(ii) Write a short note on procedures calls. (6)
11. (i) Discuss the various methods for translating Boolean expression. (8)
(ii) Explain the process of generating the code for a Boolean expression in a single pass using back
patching. 132 132 132 11267 3 [8 marks]
12. (i) Write down the translation scheme to generate code for assignment statement. Use the scheme for generating three address code for the assignment statement g: = a+b-c*d. (8)
(ii) Describe the various methods of implementing three-address statements. (8)
13. (i) Discuss the issues in the design of code generator. (10)
(ii) Explain the structure-preserving transformations for basic blocks. (6)
14. (i) Explain in detail about the simple code generator. (8)
(ii) Discuss briefly about the Peephole optimization. (8)
15. (i)Explain the code-generation algorithm in detail.
(ii) Construct the dag for the following basic block.
d: =b*c e: = a +b b: =b*c a: =e-d
16. (i) Explain in detail about the various issues in design of code generator.
(ii) Write an algorithm to partition 3 sequence of three address statements into basic blocks.
17. (i) Explain the principal sources of optimization in detail.
(ii) Discuss the various peephole optimization techniques in detail
18. (i) Explain in detail optimization of basic blocks with example. [8}
(ii) Write about Data flow analysis of structural programs. (8)
19. (i) Write in detail about function-preserving transformations. (8)
(ii) Discuss briefly about Peephole Optimization. (8)
20. (i) Write an algorithm to construct the natural loop of a back edge. (6)
(ii) Explain in detail about code-improving transformations. (10)
Anna University Chennai
Department of B.E CSE
Sixth Semester
CS2352 Principles of Compiler Design
November / December 2015 Exam Important Questions
(Regulation 2008)
IUQP Important Questions
Anna University, Chennai
Department of B.E CSE
B.E / B.TECH DEGREE EXAMINATION Nov / Dec 2015
SIXTH SEMESTER
CS2352 Principles of Compiler Design
(REGULATION 2008)
1. (i) What are the various phases of the compiler? Explain each phase in detail.
(ii) Briefly explain the compiler construction tools.
2. (i) Explain briefly about input buffering in reading the source program for finding the tokens. (8)
(ii) Construct the minimized DFA for the regular expression
(O+l)*[0+1) 10. (8)
3. (a) (i) Describe the various phases of complier and trace the program segment 4 : * + = c b a for all
phases. (10)
(ii) Explain in detail about compiler construction tools. (6)
4. (i) What are the issues in lexical analysis?
(ii) Elaborate in detail the recognition of tokens
5. (i) Explain the details about the specification of a simple type checker
(ii) How to sub-divide a run-time memory into code and data areas. Explain
6. Construct a canonical parsing table for the grammar given below:
E -> E + T, E -> T, T -> T * F, T -> F, F -> (E), F -> id
7. What are the different storage allocation strategies ? Explain (16)
8. (i) Distinguish between the source text of a procedure and its activation at run time. (8)
(ii) Discuss the various storage allocation strategies in detail. (8)
9. (i) Define three-address code. Describe the various methods of implementing three address
statements with an example. (8)
(ii) Give the translation scheme for converting the assignments into three address code. (8)
10. (i) How can Back patching be used to generate code for Boolean expressions and flow of control statements? (10)
(ii) Write a short note on procedures calls. (6)
11. (i) Discuss the various methods for translating Boolean expression. (8)
(ii) Explain the process of generating the code for a Boolean expression in a single pass using back
patching. 132 132 132 11267 3 [8 marks]
12. (i) Write down the translation scheme to generate code for assignment statement. Use the scheme for generating three address code for the assignment statement g: = a+b-c*d. (8)
(ii) Describe the various methods of implementing three-address statements. (8)
13. (i) Discuss the issues in the design of code generator. (10)
(ii) Explain the structure-preserving transformations for basic blocks. (6)
(ii) Discuss briefly about the Peephole optimization. (8)
15. (i)Explain the code-generation algorithm in detail.
(ii) Construct the dag for the following basic block.
d: =b*c e: = a +b b: =b*c a: =e-d
16. (i) Explain in detail about the various issues in design of code generator.
(ii) Write an algorithm to partition 3 sequence of three address statements into basic blocks.
17. (i) Explain the principal sources of optimization in detail.
(ii) Discuss the various peephole optimization techniques in detail
18. (i) Explain in detail optimization of basic blocks with example. [8}
(ii) Write about Data flow analysis of structural programs. (8)
19. (i) Write in detail about function-preserving transformations. (8)
(ii) Discuss briefly about Peephole Optimization. (8)
20. (i) Write an algorithm to construct the natural loop of a back edge. (6)
(ii) Explain in detail about code-improving transformations. (10)
0 comments:
Pen down your valuable important comments below