Compiler Design — Summer 2019

Define lexemes, patterns and tokens.

Differentiate compilers and interpreters.

Explain analysis of source program for compilers.

Give regular definition for signed and unsigned numbers.

Check whether the following grammar is ambiguous or not. S (S) S S ε

Draw DFA from regular expression without constructing NFA. (a | b | c)* a (b | c)* #

Draw NFA from regular expression using Thomson’s construction and convert it into DFA. (a | b)* a b* a

Define handle and handle pruning.

Construct operator precedence relations table for following grammar. E E+E E E-E E E*E E (E) E id Assume suitable operator associativity and precedence.

Construct recursive descent parser for following grammar. E T A A + T A A ε T F B B* F B B ε F ( E ) F id

Differentiate top down parsing and bottom up parsing.

Construct syntax directed translation scheme for infix to postfix conversion.

Construct LL(1) parsing table for following grammar. Check whether the grammar is LL(1) or not. A  Aa B A  x B  B Cb B  Cy C  Cc C  ε1

Define Intermediate code and its importance.

Construct LR(0) item sets for following grammar. S  AaAb S  BbBa A  ε B  ε

Explain various error recovery schemes in detail.

Differentiate LR(1) and LALR(1) parsers.

Construct syntax tree and DAG for following expression. a = (b+c+d) * (b+c-d) + a

Explain quadruples, triples and indirect triples with examples.

Define basic block with a simple example.

Explain activation record.

Explain various methods of peephole optimization.

Explain static storage allocation.

Explain any two parameter passing methods.

Explain various issues in design of code generator.