Thursday, June 4, 2015

CS2352 Principles of Compiler Design April May 2015 Grace Marks

CS2352 Principles of Compiler Design April May 2015 Grace Marks
Are you looking for CS2352 Principles of Compiler Design April May 2015 Grace Marks? You can find the details regarding grace marks below. This subject is one of the Anna University Chennai April May 2015 BE BTech exams. It's obviously 06th Semester BE EEE. Read more here under.

CS2352 Principles of Compiler Design Grace Marks Details:-
University Anna University Chennai
Subject: Principles of Compiler Design
Subject Code: CS2352
Total Grace Marks: 24 marks

Reason for 24 marks as grace marks for CS2352 Principles of Compiler Design:-

Question No: 2 => Marks: 2 Marks

Question No: 11) a.i => Marks: 4 Marks

Question No: 11) a.ii => Marks: 8 Marks

Question No: 14) a.i => Marks: 4 Marks

Question No: 14) b.i => Marks: 6 Marks

Total: 24 Marks 

Saturday, May 9, 2015

CS2352 Principles of Compiler Design 2015 B.E CSE 6th Sem Question Paper

Looking for CE2352 Principles of Compiler Design 2015 question paper? Here's attached a recent question of CE 2352 for which the exam was conducted on 9th May 2015, Saturday by Anna University Chennai. This CS 2352 question paper is for even semester 6th semester degree examination in Computer Science and Engineering. The question paper code is 71391. See more details in the scanned copies of original CS2352 question paper and download it for your upcoming exams. This question paper is also common for PTCS 2352 Principles of Compiler Design for B.E Part-Time 6th semester regulation 2010 students. R-2008 and 2010 is applicable for regular examinations of CS 2352 Principles of Compiler Design in sixth semester.

Anna University Chennai - 25
Question Paper Code: 71391
B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2015.
Sixth Semester 
Computer Science and Engineering
CS 2352, CS 62, 10144 CS 602 - Principles of Compiler Design
Regulation 2008 and 2010
Common to PTCS 2352 - Principles of Compiler Design for B.E Part-Time Fifth Semester Computer Science Engineering Regulation 2009
Time: Three hours
Maximum: 100 marks




Looking for Anna university may 2015 B.E CSE PCD [Principles of Compiler Design] grace mark details? Will be coming soon, Check back after few days!

Saturday, June 7, 2014

CS1352 - Principles of Compiler Design, Anna University, BE CSE 2009 Question Paper

CS1352 - Principles of Compiler Design, Anna University, BE CSE 2009 Question Paper
Looking for old, model, previous years question papers of CS1352 - Principles of Compiler Design? Here provided is an old question paper of this paper for B.E CSE conducted in the year 2009. Read the contents of the "Principles of Compiler Design".

Anna University, Chennai
B.E/B.Tech. Degree Examination, May/June 2009
Sixth semester
Computer Science and Engineering
CS1352-PRINCIPLES OF COMPILER DESIGN
(Regulation 2004)
Time:Three hours
Maximum:100 marks
Answer All questions
Part A - (10 * 2 = 20 marks)

1. What are the issues to be considered in the design of lexical analyzer?

2. Define concrete and abstract syntax with example.

3. Derive the string and construct a syntax tree for the input string ceaedbe using the grammar S->SaA|A,A->AbB|B,B->cSd|e

4. List the factors to be considered for top-down parsing.

5. Why is it necessary to generate intermediate code instead of generating target program itself ?

6. Define back patching.



7. List the issues in code generation.

8. Write the steps for constructing leaders in basic blocks.

9. What are the issues in static allocation?

10. What is meant by copy-restor?

PART B - (5 * 16 = 80 Marks)

11. (a) (i) Explain the need for dividing the compilation process into various phases and explain its functions. (8)

(ii) Explain how abstract stack machine can be used as translators. (8)

(or)

(b) What is syntax directed translation? How it is used for translation of expressions? (16)

12. (a) Given the following grammar S->AS|b,A->SA|a Construct a SLR parsing table for the string baab (16)

(or)

(b) Consider the grammar E->E+T,T->T*F,F->(E)\id.Using predictive parsing the string id+id*id. (16)

13. (a) Explain in detail how three address code are generated and implemented.

(or)

(b) Explain the role of declaration statements in intermediate code generation.

14. (a) Design a simple code generator and explain with example.

(or)

(b) Write short notes on:

1: Peep hole optimization

2: Issues in code generation

15. (a) Explain with an example how basic blocks are optimized.

(or)

(b) Explain the storage allocation strategies used in run time environments.

Friday, April 11, 2014

Hindustan Institute of Technology and Science (HITE): B.E. CSE, Principles of Compiler Design 2011 Question Paper

Hindustan Institute of Technology and Science (HITE): B.E. CSE, Principles of Compiler Design 2011 Question Paper
Are you presently studying at Hindustan Institute of Technology and Science (HITE)? Looking for old question papers of "Principles of Compiler Design" ? Here under, you can find this question paper which comes under B.E Computer Science and Engineering. In 2011 university exams, this paper was asked. Read on to get your question paper!

University: Hindustan Institute of Technology and Science (HITE)
Course: B.E Computer Science and Engineering 
Subject: Principles of compiler design
Year in which question asked: 2011

PART A (10 x 2 = 20 marks)

1. What is the difference ranging from phase and pass?

2. List out the compiler construction tools.

3. What are the volumes of grammar?
4. Define "Handles".
5. What is Back patching?
6. Which language uses post-fix notation as intermediate code?
7. What is the input to Code generation routine?
8. What do you understand from next-use information?
9. What is the purpose of Basic blocks?
10. Define "Black Stripper".

PART B (5 x 16 = 80 marks)

11. (a) Discuss in detail the structure of compiler.
or
(b) With example discuss how token are identified.

12. (a) Discuss Stack implementation of shift decrease parsing with example.
or
(b) Discuss predictive parsing technique with example.

13. (a) Discuss Quadruples and Triples with example.
or
(b) How will you convert control flow representation into intermediate code?

14. (a) Discuss in detail about simple code generator.
or
(b) Provide detailed explanation about Peephole optimization.

15. (a) Discuss in detail the Global data flow analysis with illustration.
or
(b) How memory is allocated when recursive procedure is used?

Search Everything Here