Compiler Design — Winter 2020

Compare and contrast compilers and interpreters.

Write a short note on LEX Tool.

Explain phases of compilers with suitable example.

Define terms: pattern, lexeme, token

Write any one method used in lexical analyzer for buffering the input.

Construct nondeterministic finite automata by using Thomson’s Construction for following regular expression. Show the sequence of moves made in processing the input string ababbab. (a|b)* abb

Consider the following grammar to construct leftmost and right most derivation for the sentence abab. SaSbS|bSaS|ε

Write rule(s) to check grammar is left recursive or not. Remove left recursive from the following grammar. SaBDh BBb|c DEF Eg| ε Ff| ε

Construct the SLR parsing table for the following Grammar. E E+T | T T T*F | F F (E) | id

Write rule(s) to check grammar is operator grammar or not.

Explain any two error-recovery strategies.

Construct LALR parsing table for the following grammar. S -> CC C -> cC C -> d1

Define : 1) synthesized attribute 2) inherited attribute

Explain any two parameter passing methods.

Write SDD for arithmetic expression and Construct annotated parse tree for the input expression (4*7+1)*2 .

What is activation record?

What is Intermediate form of the code? What are the advantages of it?

Construct syntax directed translation scheme and definition that translate arithmetic operation from infix to postfix in which an operator appears before its operand as for example xy- is a positive notation for x-y . Give annotated parse tree for the input 9-5+2 and 9-5*2.

Explain any two issues in design of code generator

Compare: static v/s dynamic Memory Allocation.

Translate the expression –(a+b)*(c+d)+(a+b+c) into 1. Quadruples 2. Triples 3. Indirect triples

What are the limitations of static storage allocation?

Write a short note on Symbol table management.

Write any two methods of code-optimization in detail.