Scribd
Upload
8 views9 pages

IMP Differences & Definition:: 5) Compare: S Vs L Attributes. (M-3)

Uploaded by

kirtan savaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views9 pages

IMP Differences & Definition:: 5) Compare: S Vs L Attributes. (M-3)

Uploaded by

kirtan savaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

IMP Differences & Definition:

1) Compare: Static Vs Dynamic Memory Allocation. (M- 4)


2) Compare: Ambiguous Vs Unambiguous Grammar. (M- 4)
3) Compare: Top down Vs Bottom up Parsing. (M- 3)
4) Compare: Stack Vs Heap Memory Allocation. (M- 4)
5) Compare: S Vs L Attributes. (M- 3)

6) Compare: Parse Vs Syntax Tree. (M- 4)


1) Overview of the Compiler & its Structure:

1) What is compiler? What is front end & back end of compiler? (M- 3)
2) Explain input, output & action performed by each phases of compiler with example? (M- 7)

3) Explairt phases of compilers with suitable example. (M- 7)


4) Explain the roles of linker, loader and preprocessor. (M- 3)

5) Explain the language dependent & machine independent phases of compiler. Also List major functions done by
compiler. (M- 7)
6) Define: Compiler, Interpreter. (M- 3)
2) Lexical Analysis:

D Write a brief note on input buffering techniques. Why it is used? (M- 4)

2) ‘What is lexical analysis? Which are the tasks performed by lexical analyzer. (M- 3)
3) Construct DFA without constructing NFA for R.E.: (a/b)*abb*. (M- 7)
4) Prepared Regulator Expressions related Sums. (M- 3/4)
5) Define lexemes, patterns and tokens. (M- 3)

6) Write a short note on input buffering techniques. (M- 4)

7 Describe the role of lexical analyzer. (M- 3)


3) Syntax Analysis:
] Define: Synthesized & Inherited Attributes, Handle, Handle Pruning, Ambiguous Grammar. (M- 4)

2) Construct SLR parsing table for grammar: s > (L) |a,L > L,S | S. (M- 7)

3) Give rule to remove left recursive grammar. Eliminate left recursion of grammar: S Aa | b, A> Ac | Sd | f(M- 4)

4) What is left factoring in CFG? Perform left factoring: S=> iEtS | iEtSaS | a, E b. (M- 4)

5) Give the translation scheme that convert infix to postfix notation. (M- 3)

6) Explain shift reduce parsing technique in brief. (M- 3)

7 What are conflicts in LR Parser? What are their types? Explain with an example. (M- 7)

8) ‘What do you mean by left recursion and how it is eliminated? (M- 3)

9) Explain handle and handle pruning. (M- 4)


10) What is dependency graph? Explain with example. (M- 4)
11) Explain a rule of Left factoring a grammar and give Example. (M- 7)

12) Define the terms & give example of it. 1) Augmented Grammar, 2) LR(0) Item, 3) LR(1) Item. (M- 4)

13) Explain synthesized attributes with the help of an example. (M- 7)


4) Error Recovery:

1) Explain Error Recovery Strategics. (M- 4)

2) Explain the following with example 1) Lexical phase error 2) Syntactic phase error. (M- 4)
3) Discuss the functions of error handler. (M- 4)
5) Intermediate Code Generation:

1) Translate the expression —(atb)*(c+d)*(atb*c) into Quadruples, Triples, Indirect Triples. (M- 7)
2) Explain the following parameter passing methods. 1. Call-by-value 2. Call-by-reference 3. Copy-Restore 4.

Call-by-Name. (M- 4)
6) Run Time Environments:

1) Explain Dynamic Memory Allocation Strategy. (M- 4)


2) Write a short note on Symbol Table Management. (M- 4)
3) Explain Activation Record. (M- 4)

4) List and explain various storage allocation strategies. (M- 7)


5) What do you mean by dangling references? (M- 3)
6) Explain activation tree? (M- 4)
7) Explain symbol table. For what purpose , compiler uses symbol table? (M- 3)
7) Code Generation & Optimization:

D Explain various issues in design of code generator. (M- 7)


2) Explain Basic Block & Flow Graph with example. (M- 3)
3) Explain various code optimization technique in detail. (M- 7)
4) Construct syntax tree & DAG for expression: X = a*(b+c)-(b+c)*d. (M- 4)

5) What is global optimization? Name the 2 types of analysis performed for global optimization. (M- 3)
6) ‘What is peephole optimization? Explain with example. (M- 7)
7 What is DAG? What are its advantages in context of optimization? How does it help in eliminating common
sub expression? (M- 7)
8) Instruction Level Parallelism:

1) Explain Pass structure of Assembler. (M- 4)


2) Explain Basic Block Scheduling. (M- 4)
3) Explain various parameter passing methods. (M- 4)
4) Define a following: 1) Basic block, 2) Constant folding, 3) Handle. (M- 3)

You might also like