Compiler Design — Summer 2018

Define cross compiler, token and handle.

Draw transition diagram for relational operators.

Explain phases of compiler with example.

Explain panic mode recovery strategy.

Write a short note on input buffering method.

Explain subset construction method with example.

Draw DFA for the following regular expression using firstpos( ), lastpos ( ) and followpos ( ) functions. ( a | b) * a

What is operator grammar? Check the following grammar is operator or not. Justify your answer. E EOE E id O * | + | -

Check the following grammar is left recursive or not. Justify your answer. If Left recursive then make grammar as non-left recursive. S ( L ) | a L L , S | S

Construct CLR parsing table for the following grammar. S CC C cC | d

Consider the following grammar and construct the corresponding left most and right most derivations for the sentence abab. SaSbS | bSaS | ε

Find out FIRST and FOLLOW for the following grammar. S 1AB | ε A 1AC | 0C B 0S C 1

Explain SLR parsing method with example.

What is symbol table? For what purpose , compiler uses symbol table?

Write a short note on activation record.

Write syntax directed definition for simple desk calculator. Using this definition, draw annotated parse tree for 3*5+4 n. OR1

Explain algebraic simplifications and flow of control optimization characteristics of peephole optimization.

Explain Quadruples and Triples form of three address code with example.

What is inherited attribute? Write syntax directed definition with inherited attributes for type declaration for list of identifiers.

Draw a DAG for expression: a + a * (b – c) + (b – c) * d.

Compare: Static v/s Dynamic Memory Allocation.

Explain any three code optimization methods.

Write difference(s) between stack and heap memory allocation.

Explain any two methods of parameter passing.

Explain various issues in design of code generator.