Complier Design — Summer 2023

Define lexemes, patterns and tokens

Write a regular definition for: 1. The language of all strings containing at least one 0 and at least one 1. 2. The language of all strings that do not end with 01. 3. The language of all strings containing 0’s and 1’s both are even. 4. The language of all strings which are starting with 1 and ending with 0.

Explain phases of compilers with suitable example.

Differentiate ambiguous and unambiguous grammar.

Write a short note on input buffering techniques.

Construct a DFA for a given regular expression using syntax tree with firstpos, lastpos and followpos function. (a|b)*a

Construct the NFA for following regular expression using Thompson’s construction. Apply subset construction method to convert into DFA. (a+b)*abb#

Give the translation scheme that convert infix to postfix notation.

Define: Left Recursive Grammar. Check Following grammar is left recursive or not, if yes, remove left recursive from it. A → ABd / Aa / a B → Be / b

Construct an SLR Parsing table for the following grammar. S  Aa | bAc | bBa A  d B  d

Explain shift reduce parsing technique in brief.

Differentiate top down parsing and bottom up parsing.

Show that the following grammar S  AaAb | BbBa A  ϵ B  ϵ is LL(1) but not SLR(1).1

Write a short note on activation record.

Explain Symbol table management in brief.

List and explain various storage allocation strategies.

What do you mean by dangling references?

Explain Error Recovery Strategies in Compiler in brief.

Write three address code for a = b*-c + b*-c

Translate the arithmetic expression (a + b) * (c + d) into 1. Syntax tree 2. Postfix notation

Compare: Static v/s Dynamic Memory Allocation

Explain various code optimization techniques.

Construct a DAG for the following expression: a = b*-c + b*-c

Explain various parameter passing methods.

Explain various issues in design of code generator.