Define following terms. i) Token ii) Lexeme iii) Handle pruning
[3 marks]Draw Transition diagram of following:
[4 marks]Relational operators. ii) Unsigned Operator.
[ marks]Explain various Phases of compiler with neat diagram and suitable examples.
[7 marks]Explain role of Lexical Analyzer and its input buffering techniques.
[3 marks]Explain finite Automata in brief and explain its role in lexical.
[4 marks]Construct SLR parsing table for the following grammar : E -> T+E | T T -> i
Explain subset construction method for constructing DFA from an NFA with an example.
[7 marks]Explain ambiguous grammar with suitable example.
[3 marks]Explain three address code mechanism.
[4 marks]Explain operator precedence parsing method with example.
[7 marks]Explain Parse Tree with appropriate examples.
[3 marks]Write a difference(s) between CLR, SLR and LALR methods.
[4 marks]Show that the following grammer S-> AaAb | BbBa A -> ϵ B -> ϵ is not SLR(1).
[7 marks]List Error Recovery Strategies in Compiler and Explain any one.
[3 marks]Explain various parameter passing methods.
[4 marks]Explain quadruples, triple and indirect triple form of three address code with example1
[7 marks]Explain operator grammar with an example.
[3 marks]Discuss synthesized and inherited attributes using a suitable grammar.
[4 marks]Write and explain the generic issues in the design of code generators.
[7 marks]Differentiate: Static v/s Dynamic Memory Allocation
[3 marks]Explain Activation record in detail.
[4 marks]Short note on Peephole Optimization Techniques.
[7 marks]Explain Control Stack.
[3 marks]Explain Dynamic storage allocation technique.
[4 marks]Explain symbol table management
[7 marks]