Compiler Design (IT-603 (A)) - Important Questions

Specify the reasons for separating the lexical analysis and syntax analysis.

Explain with an example how a LEX program performs lexical analysis for identifiers and arithmetic operators.

Construct the parse tree for the string $a+b*c$ using the grammar $E \rightarrow E+E \mid E*E \mid a \mid b \mid c$ by eliminating the ambiguity.

Compare SLR and LALR parsers.

Construct the CLR(1) parsing table for the grammar $S \rightarrow L=R \mid R$, $R \rightarrow L$, $L \rightarrow *R \mid id$.

Explain bottom-up evaluation of S-attributed definitions with an example.

Explain how an L-attributed grammar is converted into a translation scheme.

Explain dependency graph with an example.

Write the different intermediate forms for the equation $d = (a-b) + (a-c) + (a-c)$.

Define the symbol table and explain the various data structures used to implement it.

Explain the heap storage allocation strategy.

Explain optimization of basic blocks including common subexpression elimination, code motion, variable propagation and strength reduction.

Compare reducible and irreducible (non-reducible) flow graphs.

Write short notes on any two of the following.