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

Write short notes on any two of the following.

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.

List out different phases of the compiler and explain each phase's role in the compilation process.

Discuss how Finite Automata is used to recognize tokens and perform lexical analysis with an example.

Explain briefly about the LEX compiler.

Construct the CLR(1) parsing table for the given grammar.

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.

Write in detail about operator precedence parsing.

Check whether the given grammar $G: S \to L=R / R$ $L \to *R/id$ $R \to L$ is SLR(1) is correct. Explain the reasons.

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.

Explain bottom-up evaluation of L-attributes with an example.

Differentiate between S-attributed definition and L-attributed definition.

Write the syntax directed translation scheme for case statements.

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

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

Explain the heap storage allocation strategy

Construct Quadruples, triples and indirect triples for the given expression: $a+a*(b-c)+(b-c)*d.$

Differentiate between static and dynamic storage allocation strategies

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

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

Explain loop optimization techniques with an example.

Write short notes on any two of the following: