Download GTU BE/B.Tech 2019 Summer 5th Sem New 2150708 System Programming Question Paper

FirstRanker.com

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER-V (NEW) EXAMINATION - SUMMER 2019

--- Content provided by FirstRanker.com ---

Subject Code: 2150708

Date: 03/06/2019

Subject Name: System Programming

Time: 02:30 PM TO 05:00 PM Total Marks: 70

Instructions:

--- Content provided by‌ FirstRanker.com ---

1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

1. 1. Draw neat sketch diagram of Life cycle of a source program. (03)
   2. Define following: Language Migrator, Execution gap, Token, Handle (04)

   --- Content provided by⁠ FirstRanker.com ---

   3. Explain Analysis and Synthesis phase of Compiler. (07)
2. 1. Perform lexical, syntax and semantic analysis on below C statement: (03)

      
      int 1;
      float a, b;
      --- Content provided by‌ FirstRanker.com ---
      a=b+i; 

   2. Differentiate Application software with System software. (04)
   3. Write Regular expression for all string end with ‘abb’ and Construct equivalent DFA. (07)
3. 1. (1) Write unambiguous production rules to produce arithmetic expression consisting of +, *, (, ), id. (03)
      

      --- Content provided by FirstRanker.com ---

      (i1) Remove left recursion from that unambiguous production rules and generate LL(1) parsing table for that grammar. (04)
      OR
      (1) Define Operator precedence grammar. Convert following production rules of grammar into suitable Operator precedence grammar. (03)
      E — EAE |id
      A—+|*
      

      --- Content provided by‍ FirstRanker.com ---

      (i) Generate operator precedence relation matrix for converted Operator precedence grammar. Show how id - id * id will be parsed using Operator Precedence Matrix. (07)
   2. Define Assembler. List out tasks performed during different phase of assembler. (04)
   3. Given the Grammar, evaluate the string id - id * id using shift reduce parser. (07)

      
      E> E-E
      E->E*E
      --- Content provided by​ FirstRanker.com ---
      E->id 

4. 1. Compare Variant I and Variant II of intermediate code generation for assembler. (03)
   2. Write intermediate code for Variant I and Variant II of below program fragment. (04)

      
      START 200
      --- Content provided by FirstRanker.com ---
      READ A
      LOOP MOVER AREG, A
      SUB AREG,=’1"
      BC GT,LOOP
      STOP
      --- Content provided by FirstRanker.com ---
      A DS 1
      LTORG 

   3. Define forward references. How it can be solved using back-patching. (07)
5. 1. Describe following data structures: OPTAB, SYMTAB, LITTAB and POOLTAB. (03)

   --- Content provided by​ FirstRanker.com ---

   2. List out assembler directives and explain any two advance assembler directives. (04)
   3. Differentiate Linker and Loader. (07)
6. 1. Define Macro - preprocessor. Explain steps of Macro Preprocessor Design. (03)
   2. Explain use and field of following tables of a macro KPDTAB, MDT, EVTAB, SSTAB (04)
      

      --- Content provided by FirstRanker.com ---

      OR
      Explain Nested macro call with suitable example. (03)
   3. Explain attributes of formal parameter and expansion time variable in macro. (07)
7. 1. Write a brief note on MS-DOS Linker. (03)

   --- Content provided by⁠ FirstRanker.com ---

   2. Explain the term self-relocating program. (04)
   3. Define overlay. Explain the execution of an overlay structured program. (07)
8. 1. List out various Code Optimization techniques used in Compiler. Explain any three technique with suitable example. (03)
      OR
      

      --- Content provided by‌ FirstRanker.com ---

      Differentiate Compiler and Interpreter. (03)
   2. Compare Absolute Loader with Relocating Loader (BSS Loader). (04)
   3. Explain triple, quadruple and indirect triples representation with example. (07)

FirstRanker.com

--- Content provided by​ FirstRanker.com ---