Define following terms: i. Compiler ii. Interpreter iii. Assembler iv. Regular Expression v. Token vi. Lexeme vii. Pattern
[7 marks]How do the parser and scanner communicate? Explain with the block diagram communication between them. Also explain: What is input buffering?
[7 marks]Construct DFA for following regular expression without constructing NFA and optimize the same. ( a | ε )* a b ( a | b )* #
[7 marks]Discuss various Storage allocation strategies in detail.
[7 marks]Explain various data structures used in symbol table management.
[7 marks]Construct a SLR parsing table for following grammar. S -> aAb | bB A -> Aa | ϵ B -> Bb |ϵ
[7 marks]Check whether the given grammar is LL (1) or not? S -> aAC | bB A -> Abc | Abd | e B -> f | g C -> h |i
[7 marks]Construct the LALR parsing table for the following grammar. S -> CC C -> aC C -> d
[7 marks]Write a syntax directed definition for desk calculator. Justify whether this is an S-attributed definition or L-attributed definition. Using this definition draw annotated parse tree for 3*5+4n.
[7 marks]What is intermediate code? Explain different types of intermediate code representations. Also discuss importance of intermediate code.
[7 marks]Explain activation tree, control stack, the Scope of Declaration and Bindings of Names.
[7 marks]Explain Operator precedence Parsing technique in detail.
[7 marks]Write down short note on Error – Recovery Strategies.
[7 marks]i. Construct the DAG for the following basic block: d: = b * c e: = a + b b: = b * c a: = e – d ii. Describe issues in code generation process.
[7 marks]Explain Peephole Optimization in detail.
[7 marks]Write Short notes on i. Local and loop optimization ii. induction variable elimination
[7 marks]Explain automatic generation of lexical analyzer and parser.
[7 marks]