Define: Compiler, Assembler, and Interpreter.
[3 marks]Compare: Parse tree and Syntax tree.
[4 marks]Explain the phases of compiler with an example.
[7 marks]Explain role of Lexical Analyzer and its input buffering techniques
[3 marks]Illustrate an Ambiguous grammar with an example.
[4 marks]Construct NFA for the following RE using Thomson's construction method and then convert it to DFA (a|b)*abb
[7 marks]Construct Shift Reduce Parser for the String id+ id*id. Consider following grammar
[7 marks]Define the term Regular Expression. Write down the regular expression for the string start with 1 and end with 0, over ⅀={ 0 , 1}
[3 marks]Explain Finite Automata and its types
[4 marks]Define the term Parser. Difference between Top Down Parser and Bottom up Parser.
[7 marks]Define: Token, Pattern and Lexeme.
[3 marks]Demonstrate Left recursion from the following grammar and rewrite the Grammar. S -> Aa | b A -> Ac | Sd | ԑ
[4 marks]Construct predictive parsing table for the following grammar. E E + T/ T E T * F / F F (E) | id
[7 marks]What is intermediate code? Explain its advantage.
[3 marks]Explain Left Factoring with the help of example.
[4 marks]Demonstrate quadruple, triple and indirect triple with suitable example.1
[7 marks]Classify Error Recovery Strategies in Compiler and Explain any one.
[3 marks]Explain Handle and Handle Pruning.
[4 marks]Discuss various code optimization techniques.
[7 marks]Describe Symbol Table Management.
[3 marks]Explain the structure of an activation record with all its components.
[4 marks]Discuss synthesized and inherited attributes. Write example of SDD for a desk calculator.
[7 marks]Compare: Static v/s Dynamic Memory Allocation
[3 marks]Explain Peephole Optimization.
[4 marks]Discuss generic issues in the design of code generation.
[7 marks]