Complier Design — Summer 2025

Compare and contrast compilers and interpreters.

Give the significance of left factoring and explain with an example.

Explain phases of compiler in context of front end and back end with example. Give the significance of both.

Define following terms. 1) Lexeme 2) Handle pruning 3) Viable prefixes

Write regular expression over {a,b} 1. The set of all strings which starts and ends with different symbols 2. The set of all strings having even number of “a” 3. The set of all strings having odd number of “b” 4. The set of all strings having at least two times “a”

Construct LL(1) parsing table for the following Grammar: S -> aABb A-> c | ε B-> d | ε

Construct NFA for following regular expression using Thompson’s construction and then convert it into DFA. ab(a|b)*ab*.

Differentiate between parse tree and syntax tree

What is inherited attribute? Explain with suitable example.

Check whether the following grammar is SLR or not S -> AaAb | BbBa A -> ε B -> ε

Compare and contrast SLR and LALR.

Write down the algorithm for partitioning of basic blocks.

Explain operator grammar. Generate precedence function table for the following grammar. E -> EAE | id A -> + | *

What is sentinel? Explain with an example.

Explain Error Recovery Strategies in brief.

Explain quadruples, triple and indirect triple form of three address code with example.1

Draw a DAG for expression: a + a * (b – c) + (b – c) * d.

Explain various parameter passing methods.

Write syntax directed definition for simple desk calculator. Using this definition, draw annotated parse tree for 7*9+6 n.

What do you mean by dangling references?

Which are the different conflicts occurs during constructing LR parsing table? Explain in detail.

Implement the following grammar using Recursive Descent Parser. S -> Aa | bAc | bBa A -> d B -> d

Differentiate top down and bottom up parser.

Write a short note on symbol table.

What is peephole optimization? Explain with example.