What is the difference between System Software and Application software?
[3 marks]Define following terms: 1) Assembler 2) Macro 3) Parsing 4)Interpreter
[4 marks]Explain Life cycle of source program with neat sketch.
[7 marks]Explain memory allocation in block structured language.
[3 marks]Explain in detail any two advanced assembler directives.
[4 marks]Given a grammar, E →TA, A → +TA | ε T →VB B →*VB | ε V →id | (E) Develop an LL (1) parser table and parse following string using the parsing table. id * ( id + id)
[7 marks]Given the source program: START 100 A DS L1 MOVER AREG, B ADD AREG, C MOVEM AREG, D D EQU A+1 L2 PRINT D ORIGIN A-1 C DC ‘5’ ORIGIN L2+1 STOP B DC ‘19’ END L1
[3 marks]Show the contents of the symbol table at the end of Pass I.
[ marks]Explain the significance of EQU and ORIGIN statement in the program and explain how they are processed by the assembler.
[ marks]Show the intermediate code generated for the program.
[ marks]Compare various intermediate code forms for an assembler.
[3 marks]Describe following data structures: OPTAB, SYMTAB, LITTAB and POOLTAB.
[4 marks]Explain use and field of following tables of a macro KPDTAB, MDT, EVTAB, SSTAB1
[7 marks]Explain following terms with suitable example. 1. Expansion time variable 2. Positional parameter
[3 marks]Explain Left recursion, Left factoring in top down parsing
[4 marks]What is operator precedence parsing? Show operator precedence matrix for following operators: +, - , *, (,). Parse following string: |- <id> + <id> * <id> -|
[7 marks]Define forward references. How it can be solved using back-patching.
[3 marks]Explain triple and quadruple representation with example.
[4 marks]What is program relocation? How relocation is performed by linker? Explain with example.
[7 marks]Explain the term loader with its basic function.
[3 marks]Explain types of grammar.
[4 marks]Explain with examples - expansion time variables, expansion time Statements - AIF and AGO for macro programming. Show their usage for expansion time loop by giving example.
[7 marks]Explain any three Code Optimization Techniques.
[3 marks]Define: L-Attributed definition in detail.
[4 marks]By taking the example of factorial program explain how activation record will look like for every recursive in case of factorial (3).
[7 marks]Explain lexical analysis of language processor
[3 marks]Explain the terms Binding and Binding Times.
[4 marks]Explain the drawbacks and benefits of Interpretation
[7 marks]