Compiler Design — Summer 2021

What is Compiler? Explain working of all the phases of compiler with a sample string as input.

Explain peephole code optimization in detail with examples.

Explain Input Buffering in detail with example. Also explain importance of sentinel character.

Draw DFA for given expression- aa*ab*c#

Prove give regular expressions are equal by generating their optimized DFAs. 1) (a | b)* 2) (a* | b*)*

Explain difference between ambiguous and unambiguous grammar with example in detail. Write unambiguous grammar for desk calculator.

Draw LL(1) parsing table for the following grammar. S  iEtSS’ | a S’  eS | € E  b

Explain rules to eliminate left recursion with example. Also explain left factoring in detail with example.

Design predictive parsing table for following grammar. E  E+T E  T T  T*F T  F F  id

Check whether given grammar is Valid LR(0) grammar or not. E  E+T E  T T  T*F T  F F  id

Write SDD for desk calculator grammar.

Write Translation scheme for desk calculator grammar.

Check whether given grammar is valid LALR grammar or not. S  L = R | R L  * R | id R  L

Explain error recovery techniques in detail with examples.

Explain following in detail. 1) Quadruple 2) Triple 3) Indirect Triple

Explain Code Generation algorithm in detail.

Explain various storage allocation techniques in detail.