Compiler Design — Winter 2023

Describe the role of preprocessor, assembler and loader in program execution.

Compare and contrast compilers and interpreters.

Explain phases of compiler in context of front end and back end with example. Give the significance of both.

Define following terms. 1) Handle pruning 2) Unambiguous grammar 3) Left recursion

What is common prefix problem? Write steps to solve it with example.

Construct NFA for following regular expression using Thompson’s notation and then convert it into DFA. ab*a(a|b)*bb.

Construct SLR parsing table for the following grammar : E -> T+E | T T -> i

What is sentinel? Explain with an example.

Differentiate synthesized and inherited attributes.

Construct LL(1) parsing table for the following Grammar after applying necessary action. S→ 1AB | ε A→ 1AC | 0C B→ 0S C→ 1

What is operator grammar? Explain with example.

Construct LR (1) item set for following grammar. E -> E+T | T T -> T*F | F F -> id

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

Define basic block with a simple example.

Which are the different conflicts occurs during constructing LR parsing table? Explain in detail.

Explain the issues regarding code generation in compiler design with example.

Differentiate SLR, LALR and CLR.

Write a short note on peephole optimization.1

Explain quadruples, triple and indirect triple form of three address code with example.

Give the regular definition for unsigned numbers in Pascal and also construct transition diagram for that.

Write a short note on symbol table.

Explain all error recovery strategies using suitable examples.

What is activation record?

Explain any two methods of parameter passing.

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