Download AKTU B-Tech 6th Sem 2016-2017 ECS603 Compiler Design Question Paper

B.TECH.

THEORY EXAMINATION (SEM–VI) 2016-17

COMPILER DESIGN

Time: 3 Hours

Max. Marks: 100

Note: Be precise in your answer. In case of numerical problem assume data wherever not provided.

--- Content provided by⁠ FirstRanker.com ---

SECTION – A

1. Attempt the following: 10 x 2 = 20
   1. State any two reasons as to why phases of compiler should be grouped.
   2. Write regular expression to describe a language consist of strings made of even numbers a & b.
   3. Write a CF grammar to represent palindrome.
   4. Why are quadruples preferred over triples in an optimizing compiler?
   5. Give syntax directed translation for case statement.

   --- Content provided by​ FirstRanker.com ---

   6. What is a syntax tree? Draw the syntax tree for the following statement: cbcba - * + = *
   7. How to perform register assignment for outer loops?
   8. List out the criteria for code improving transformations.
   9. Represent the following in flow graph i=1; sum=0; while (i<=10){sum+=i; i++}
   10. What is the use of algebraic identities in optimization of basic blocks?

   --- Content provided by​ FirstRanker.com ---

SECTION - B

2. Attempt any five of the following questions: 5 x 10 = 50
   1. Explain in detail the process of compilation. Illustrate the output of each phase of compilation of the input “a=(b+c)*(b+c)*2".
   2. Construct the minimized DFA for the regular expression (0+1)*(0+1) 10.
   3. What is an ambiguous grammar? Is the following grammar ambiguous? Prove E ? E + E | E(E) | id
   4. Draw NFA for the regular expression ab*/ab.

   --- Content provided by​ FirstRanker.com ---

   5. How names can be looked up in the symbol table? Discuss.
   6. Write an algorithm to partition a sequence of three address statements into basic blocks.
   7. Discuss in detail the process of optimization of basic blocks. Give an example
   8. How to subdivide a run-time memory into code and data areas. Explain

--- Content provided by FirstRanker.com ---

SECTION - C

3. Attempt any two of the following questions: 2 x 15 = 30
   1. Consider the following grammar
      S ? AS | b
      A ? SA | a.
      Construct the SLR parse table for the grammar. Show the actions of the parser for the input string "abab”.
   2. How would you convert the following into intermediate code? Give a suitable example.
      

      --- Content provided by FirstRanker.com ---

      i) Assignment Statements.
      ii) Case Statements
   3. Define a directed acyclic graph. Construct a DAG and write the sequence of instructions for the expression a+a*(b-c)+(b-c)*d.

FirstRanker.com

--- Content provided by​ FirstRanker.com ---