Complier Design — Winter 2024

Differentiate the following terms 1) interpreter and compiler 2) parse tree and syntax tree

Explain input buffering technique

Explain phases of compiler with an example

Explain left recursion with an example

Explain lexeme, token and pattern with an example

Construct transition diagram for relational operators. Explain roles of assembler, loader, linker and preprocessor

Construct DFA without constructing NFA for the regular expression (a+b)*abb over input alphabets ∑ = {a,b}

Design LL (1) parsing table for the following grammar E → E + T | T 2) T →T*F | F 3) F → (E) | id

Explain ambiguous grammar with an example

Design LALR parsing table for the following grammar S → CC C → cC | d

Compare top down and bottom up parsing

Explain left factoring of grammar with an example

Explain operator precedence parsing

Briefly explain error recovery strategies

Write a short note on syntax directed definition

Explain Quadruples, Triple, Indirect Triple with an example

Explain flow graph with suitable example

Draw annotated tree for an arithmetic expression 9+5-2

Explain symbol table

Explain peephole optimization technique

Explain activation record

Explain any three code optimization techniques in detail

Explain stack allocation strategy

Explain various parameter passing methods

Compare: static v/s dynamic memory allocation