STUPIDSID
1 (a)
Explain Buffer pairs and Sentinels.
7 M
1 (b)
Draw Transition diagram of following:
i. Relational operators.
ii. Unsigned operator.
i. Relational operators.
ii. Unsigned operator.
7 M
2 (a)
Explain recursive-descent and predictive parsing.
7 M
2 (b)
Construct minimum state DFA?s for following regular expressions.
i. (a|b)*a(a|b)
ii. (a|b)*a(a|b) (a|b)
i. (a|b)*a(a|b)
ii. (a|b)*a(a|b) (a|b)
7 M
2 (c)
What do you understand by a handle? Explain the stack implementation of shift
reduce parser with the help of example.
7 M
3 (a)
Show that the following grammar S → AaAb | BbBa A → εB → ε is LL(1) but not SLR(1).
7 M
3 (b)
Show that the following grammar S → Aa | bAc | dc | bda A → d is LALR(1) but not SLR(1).
7 M
3 (c)
Show that the following grammar
S → Aa | bAc | Bc | bBa A → d B → d is LR(1) but not LALR(1).
7 M
3 (d)
Explain various error recovery strategy of compilers.
7 M
4 (a)
Construct a Syntax-Directed Translation scheme that translates arithmetic
expressions from intfix into postfix notation. Show the application of your
scheme to the string "3*4+5*2".
7 M
4 (b)
What is the use of a symbol table? How identifiers are stored in the symbol
Table?
7 M
4 (c)
Explain quadruple, triple and indirect triple with suitable example.
7 M
4 (d)
Explain with an appropriate example how to perform bottom up evaluation of an
inherited attributes.
7 M
5 (a)
Explain various code optimization technique.
7 M
5 (b)
Describe algorithm for global common subexpression elimination.
7 M
5 (c)
Explain code generator design issues.
7 M
5 (d)
Explain Stack allocation and Activation record organization in brief.
7 M
More question papers from Compiler Design