Compiler Design

(a) Show that the given Grammar is LL(1) but not SLR(1)

What is the significance of symbol table in compiler? What information is represented by symbol tables? Explain the data structure used for symbol tables. 

Attempt  question.

(h) Perform recursive descent parsing over the input mpp for the grammar.

Attempt  question.

(g) Define FIRST and FOLLOW sets for a grammar.

Attempt  question.

(f) What are the advantages of performing the LR parsing?

Attempt  question.

e) Define ambiguity in a grammar.

Attempt  question.

(d) What compiler check during the syntax analysis? Mention the role of parser with the help of suitable figure during the syntax analysis

Attempt  question.

(c) Mention the role of Lexical Analyser in compiler design.

Attempt  question.

(b) Design the Finite Automata for the regular expression a(a + b)a.

Attempt  question.

(a) Distinguish between compiler and interpreter. Define Cross Compiler and identify the few cases where such cross compiler will be useful.

Draw the Syntax Tree and DAG for the expression (a*b) + (c-d) * (a*b) + b 

What are the criteria that need to be considered while applying the code optimization technique? Mention the issues involved in designing of code generation. 

What is activation record? Briefly outline Run time storage administration. Discuss different error handling techniques. 

Attempt  question.

(i) What is Peephole optimization? How is it performed Give example of peephole optimization. 

(a) Draw the Syntax tree for the following piece of code in the source language:If x >y then x = 3^* (y+1) else y = y+l. 

What are the benefits for the three address code generation? Consider the input string  and generate the following:

(a) Syntax Tree       (b) Posix         (c) Three address Code

(b) Discuss all three methods which are used to perform the LR parsing. Which technique is most powerful among these three? Give justification also.

(a) Consider the following grammar and Parse the input string int id, id; usingshift reduce parser. 

(b) Find whether the grammar is ambiguous or not:

How to remove ambiguity from this grammar 

(a) Design a derivation tree for the following grammar:

 Also obtain the left most and rightmost derivation tree for the string 'a+b*a+bº. 

Write short note on:

(ii) Uses of Basic Blacks.

Write short note on:

(i) Problems in code generation 

(c) Explain Chomsky hierarchy of grammars. 

(b) Construct a nondeterministic finite automaton (NFA) and then deterministic finite automaton (DFA) for the regular expression (a/b)c*)* 

(a) What do you mean by front end and back end of a compiler.

a) Why we need code optimization? Explain Strength reduction, Sub expression elimination, dead code elimination and loop optimization techniques.

C Explain different data structures for symbol table implementation and compare them 

(b) Explain how scope information is represented b y symbol table.

(a) What are the uses of symbol table in different phases of compiler Design?

(b) Translate the following expression to quadruple and triple representation

A=-B * (C+D/E 

(a) Construct a syntax directed translation scheme that translates arithmetic expressions from infix to postfix notation. The solution should include context free grammar and semantic rules. Show the application of your scheme with the input given below.

[b] Lenstruct the canonical parsing table for the grammar given below.

(a) Explain Recursive Decent Parser with example.

(b) Give parse tree's and derivation's leftmost and rightmost] for the grammar and input string given below.

Attempt  question.

(j) What is DAG? What are the advantages of using DAG?

a. Consider the following grammar: 

i) Obtain LR(0) items. 

b. Explain the following with an example:

    i) Quadruples

a. Explain how DAG will help in intermediate code generation Construct & DAG and a three address code for the expression 

c. Define the following with example:

ii) L-attributed definitions.

c. Define the following with example:

i) S-attributed definitions

b. Obtain SDD for simple type declaration. Construct a dependency graph for the declaration float a, b, c along with evaluation order.

a. For the given productions shown below, write semantic rules and construct annotated parse tree for 3*5+4n

b. Consider the following grammar:

iii) Show the parsing steps for the string "baaba". 

b. Consider the following grammar:

ii) Construct canonical LR(1) parsing table.

b. Consider the following grammar:

i) Compute sets of LR(1) items. .

.a. Consider the following grammar: 

iv) Check whether the given grammar is SLR or not.

.a. Consider the following grammar: 

iii) Obtain SLR parsing table

a. Consider the following grammar: 

ii) Compute FIRST and FOLLOW

b. Explain the following with an example:

   ii) Triples

c.

For the following grammar  indicate the handle in the following right sentential from 00001111.

What is meant by handle pruning? Show the working of a shift reduce parser for accepting id + id*id, considering the grammar: 

a. Show that the following grammar is net LL(1) without constructing parsing table.

c. Write a recursive descent parser for the grammar:.  and for the input "cad" trace the parser.

iv) Show the moves made by the predictive parser on the input (a, (a, a)). 

 b. Given the grammar

iii) Construct the predictive parsing table.

 b. Given the grammar

ii) Construct FIRST and FOLLOW sets.

 b. Given the grammar

i) Make necessary changes to make it suitable for LL(1) parsing. 

a. Show that the following grammar is ambiguous:

Write an unambiguous grammar for the same.

c. Construct a transition diagram for relational operators.

b. Explain input buffering strategy used in lexical analysis phase.

a. Explain with a neat diagram, the phases of a compiler. Mention the input and output for each phase with an example, "position initial + rate* 60"

b. Generate the 3-address statements for the following programming construct and obtain the basic blocks for generated code

a. Briefly explain various issues in code generation phase.

c. Define local and non-local data.

b. What is garbage collection? Explain the design goals of garbage collector.

a. Describe the general structure of an activation record. Explain the purpose of each item in the activation record. 

c. Explain syntax directed translation of switch statement.

Explain the following with an example:

iii) Indirect triples