Download PTU B.Tech 2020 March CSE-IT 7th and 8th Sem BTCS 913 Compiler Design Question Paper

FirstRanker.com

Roll No. EEEEEEEE [ ] Total No. of Pages : 02
Total No. of Questions : 18

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

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

INSTRUCTION TO CANDIDATES :

1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

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

SECTION-A

Answer briefly :

1. Differentiate between stack allocation and static allocation.
2. Name two compiler construction tools.
3. Define ‘Code Motion’ and ‘Constant Folding’ with examples.

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

4. Define ‘Basic Block’ and write about its significance.
5. Write at least two differences between LR (0) parsers, SLR (1) parsers, CLR (1) and LALR Parsers.
6. Show that the grammar is ambiguous: S ? Sa S? bS S ? c
7. List the functions of a pre-processor.
8. How do Self Hosting Compilers work?

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

9. Name 3 forms of output of code generator.
10. Write the triple representation of x := y[i].

FirstRanker.com

SECTION-B

1. Differentiate between top down and bottom up parsing. Show the steps of a shift reduce parser on input (a,(a,a)) using the following grammar :
   

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

   S ? (L) | a
   L ? L,S | S
2. Translate the arithmetic expression a * - (b + c ) into
   1. Postfix notation
   2. Three-address code

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

3. What is the role of the lexical analyzer? Explain the issues in lexical analysis.
4. What is Code Optimization? Describe the principle sources of optimization.
5. Explain the various storage allocation strategies applied to activation records.

SECTION-C

1. Explain in detail the process of compilation. Illustrate the output of each phase of compilation for the input “a = (b+c) * (b+c) * 2”.

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

2. What is the need of symbol table. Explain various data structures used for its storage.
3. Given the CFG G = {S, {S, U, V, W}, {a, b, c, d}, P} with P given as shown below :
   S ? UVW
   U ? (S) | aSb | d
   V ? aV c
   

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

   V ? cW | e
   1. Construct a table-based LL(1) predictive parser for G;
   2. Give the parsing actions for the input string “(dc)ac”.

NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

FirstRanker.com

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