Compiler Design — Winter 2021

Define the following terms. 1) Compiler 2) Interpreter 3) Preprocessor

What is regular expression? Give all the algebraic properties of regular expression.

Explain analysis phase of the compiler with example.

Explain grouping of phases in compiler.

Draw Transition diagram of following: 1) Relational operators. 2) Unsigned Operator.

Explain subset construction method for constructing DFA from an NFA with an example.

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

What is ambiguous grammar? Discus with suitable example.

Explain the stack implementation of shift reduce parser with the help of example.

Construct LL(1) parsing table for the following Grammar and parse the string (a, a )$ using the parsing table. S -> ( L ) | a L-> L , S | S

Differentiate top down parsing and bottom up parsing.

What is Inherited attribute? Explain with suitable example

Show that the following grammer S-> AaAb | BbBa A -> ϵ B -> ϵ is not SLR(1).

What is operator grammar? Given an example.

What is the need of intermediate code? Explain quadruple, triple and indirect triple with suitable example.

Write and explain the generic issues in the design of code generators.

What is the difference between parse tree and syntax tree? Write appropriate grammar and draw parse as well as syntax tree for a + a * a.

Explain various parameter passing methods

Write a context free grammar for arithmetic expressions. Develop a syntax directed definition for the grammar. Draw an annotated parse tree for the input expression: 3*2+5n.1

Explain how panic mode and phrase level error recovery can be implemented.

Write a Syntax-directed definition for flow-of-control statement.

Explain symbol table management.

Define the following terms. 1) Basic block 2) DAG 3) Flow graph

Explain Dynamic storage allocation technique.

Explain various code optimization techniques.