Ahmedabad Institute of Technology

CE & IT Department
SYSTEM SOFTWARE (3160715)
Question Bank
Year: 2022-2023
 CHAPTER 1 – Overview of System Software
System Software(3160715 )-Expected
1 What do you mean by Address space CO1
2 Explain Different Views on the Meaning of a Program CO1
3 Explain Recent Trends in Software Development CO1
System Programming(2150708)- Old
1. Define software. Compare system software and application software. (May-2017) (May- CO1
2018)(May-2019)
2. What is mean by system programming? List some essential characteristics of system CO1
programming. (May-2019)
3. Explain system software development process in detail. (Nov-2016) (May-2019) CO1
4. Compare user-centric view and system-centric view of system software. (May-16) CO1
5 Explain Life cycle of source program with neat sketch.(May-2018)(May-2019) CO1
6 Which type of gap makes the software buggy or unreliable? Which methods can be used to CO1
overcome this situation?(Dec-2018)
7 How the use of programming language can help in making the software reliable?(Dec-2018) CO1
8 What are the advantages and disadvantages of procedure oriented language? (May-2014) (Dec- CO1
2015) (NOV-2019)
9 State True or False CO1
1. Language processing activities of an interpreter can be separated
from its program execution activities.
2. A compiler uses a queue to compile nested control structures in
a program.
3. Scope rule determines the accessibility of variables declared in
different blocks of a program (Jan 2021)

CHAPTER 2 – Overview of Language Processors

System Programming(2150708)- Old
1. Define Following terms: 1. System Software 2. Semantic Gap 3. Specification Gap 4. Execution CO2
Gap (Dec-2015)(May-2019) (NOV-2019)
2. Explain following. (1) Execution Gap (2) Interpreter (3) Phases of Compiler (4) Language CO2
Migrator (May-2011) (NOV-2019)
3. Define: Language processor. Also list different types of language processors Language migratory, CO2
Back patching, SSM .(Oct-2016)
4. Define following terms: 1) Assembler 2) Macro 3) Parsing 4)Interpreter (May-2018) CO2
5 Define the following terms:1) Back patching 2)Simple phrase grammar 3)Left recursion 4)Top- CO2
Down Parsing.(Nov-2017)
6 Which activity reduce specification gap?Explain with suitable example.Who will reduce execution CO2
gap? (Nov-2017)
7 Explain the front end of toy compiler with suitable example.(Nov-2017) CO2
8 Explain language processing activities. (Dec-2015) (NOV-2019) CO2
Page 2
 9 Explain analysis phase of language processor in detail. (Oct-2016) (NOV-2019) CO2
10 List various phases of a language processor. Explain roles of phases of Language Processor. Also CO2
explain symbol table (Dec-2011) (Dec-2015) (May-2016)
11 What is main task of semantic analysis phase? Explain inherited and synthesized attributes in CO2

Page 3
 detail with example. (May-2017) CO2
12 What is Symbol table? Explain how one can organize Symbol table using Linear Data Structure? CO2
(May-2016) (May-2017)
13 State different storage allocation strategies. Explain static allocation and stack allocation in detail. CO2
(May-2017)
14 If the string a9b had been identified as identifier, but if in the further use 9ab is written, which phase CO2
of compiler would identify as an error? How? (Dec-2018)
15 How a lexical analyzer recognizes unsigned numbers such as 12,12.3,12.3E4?(Dec-2018) CO2
CHAPTER 3 – Assemblers
System Programming(2150708)- Old
1. Which are the different assembly language statements? Explain each of them with suitable CO3
example (Dec-2014)
2. Explain assembly scheme with suitable example. (May-2018) CO3
3. Explain analysis and synthesis phases of an assembler by clearly stating their tasks. (Dec-2018) CO3
4. Briefly Explain the tasks performed by analysis & synthesis phases of simply assembly schemes. CO3
(Jun-2013)
5 Define the Assembler (Jun-2013) CO3
6 Explain use of various data structures (tables) needed in PASS I of the assembler. Also give details CO3
of their fields. Explain various suitable data structures for the symbol table (Jan-2013)
7 Explain Assembler directives (any three). (Jan-2013) (Jan 2021) CO3
8 Let us consider a two pass assembler and assume that each instruction is one word. Given an CO3
assembly program and code for Mnemonics.
START 101 Mnemonics CODE
READ A STOP 00
READ B MULT 03

MOVER BREG, A MOVER 04

MULT BREG, B MOVEM 05

MOVEM BREG, D READ 09

STOP DS 02
A DS 1
START 01
B DS 1
END 02
DDS 1
Ordinal number of BREG is 2
END

(i) Show content of symbol table at the end of pass-one of an assembler.

(ii) Write intermediate code representation of the assembly program.
Use Variant-II of intermediate code representation. (May-2011) (Jan
2021)

Page 4
 9 Explain the role of Mnemonic Opcode Table, Symbol Table, Literal Table and POOL Table in CO3
assembling process of assembly language program. (May-2011)
10 Compare single pass assembler and two pass assembler. Explain two pass assembler in detail with CO3
suitable example. (May-2011)
11 Explain and show usage by giving examples of following assembler directives: CO3
ORIGIN,EQU,LTORG, START (Dec-2011)

Page 5
 12 Describe following data structures: OPTAB, SYMTAB, LITTAB and POOLTAB (Dec- CO3
2011) (May-2017) (May-2018) (May-2019)
13 Explain two pass assembler. (May-2012) CO3
14 Explain the data structure of single pass assembler. (May-2012) (Nov-2017) (Oct-2016) CO3
15 Compare Variant I and Variant II of intermediate code generation for assembler? (Dec-2013) CO3
(May-2019) (Jan 2021)
16 Explain the complete working of first pass of the double pass assembler along with the data CO3
structure used. (Dec-2013) Explain in brief the design of a Two pass assembler. (Oct-2016)
17 Explain non-monotonic reasoning in detail. (WINTER 2015) CO3
18 What is Non-monotonic Reasoning. (SUMMER 2013) CO3
19 Explain NonMonotonic reasoning and discuss the logics for NonMonotonic CO3
reasoning . (WINTER 2013)
20 Draw a flowchart of maintaining Table of Incomplete Instruction (TII) in assembler (Dec-2013) CO3
(Nov-2017)
21 Write difference between one pass and two pass assembler. (Jun-2013) (NOV-2019) CO3
22 What are advanced assembler directives? Explain any two with suitable example. (Jun-2013) CO3
(Dec-2015)
23 What is a forward reference? Explain how to solve it. (May-2019) CO3
24 Define forward references. How it can be solved using back-patching? Explain with example. CO3
(Dec-2015)
25 Explain use of various data structures needed in pass-I of the assembler and give details of their CO3
fields (Dec-2014)
26 List out various assembler directives. Explain any three with example. (Dec-2014) (May-2019) CO3
Consider following assembly language program:
Show (i) Contents of Symbol Table (ii) Intermediate codes using Variant I representation.
Instruction opcode: STOP – 00, ADD – 01, MULT – 03, MOVER – 04, MOVEM – 05, COMP –

06, BC – 07, READ – 09, PRINT – 10, LE – 02 Assembler directives: START – 01, END – 02
Declaration statements: DC – 01, DS – 02 Register code: BREG – 02, CREG – 03 (Dec-2015)
Page 6
 (NOV-2019)
27 What are the Advanced Assembler Directives? Explain any two with example. (May-2016) 04
(NOV-2019)

Page 7
 28 What is the relevance of 1 in LL (1) parser? (Jan 2021) 07
29 What is the role of POOLTAB data structure in Pass-I of an assembler? (Jan 2021) 07
30 Explain Symbol table and Mnemonics table with suitable example (June-2013) 03
31 Given the following source program 03

START 300
A DS 5
L1 MOVER
AREG, B
ADD AREG,
C MOVEM
AREG, D
D EQU A + 1

L2 PRINT
D
ORIGIN
A–2
C DC ‘52’

ORIGIN
L2 + 3
STOP
B DC ‘46’
END L1
Show the Intermediate code generated for the program. (May-2017)
32 Explain in brief design of a two pass assembler. (May-2017) 07
33 Define forward references. How it can be solved using back-patching.(May-2018) 04
34 Explain the difference between literal and constant in assembler with its syntax. Why 07
POOLTAB is requiring? (Nov-2017) (Jan 2021)
35 Explain & compare various intermediate code forms (representations) for an assembler. 04
(Dec- 2011)
36 Define and explain different intermediate code representations. (May-2017) 03
37 Explain in detail any two advanced assembler directives. (May-2017) (May-2018) 07
38 Explain the use of intermediate code with example in assembler and also mention field of it. 04
(Nov-2017) (Jan 2021)
39 In which situation, assembly language programming holds an edge over high level language 04
programming? (Jan 2021)
Page 8
 CHAPTER 4 – Macro and Macro Processors
System Programming(2150708)- Old
1. Compare the features of subroutine and macros with respect to following.
(i) Execution speed
(ii) Processing requirement by assembler.
(iii) Flexibility and generality. (May-2011)
2. Write a macro which takes A,B, C and D as parameters and calculates A*B+C*D in AREG.
(Dec- 2013)
3. Explain positional parameters, keyword parameters and default value parameters for
macros.(Jan-

Page 9
 2013) (Dec-2018)(NOV-2019) (Jan 2021)
4. Write a macro which takes B, C, and D as parameters and calculates B*C + C*D. (May-
2011)
5 Define a macro taking A and B as parameters to compute A = A * B + B * B + A + B (Jan-
2013)
6 Explain attributes of formal parameters, default specifications of parameter and
semantic expansion for macro by giving examples. (Dec-2011) (Nov-2016)
7 Write and explain the algorithm for macro expansion.(Oct-2016)(May-2017) (June-2013)
(NOV- 2019)
8 Define a macro taking A and B as parameters to compute A = A * B + B * B + A.(Oct-2016)
9 Describe the use of stacks in expansion of nested macro calls with example.
(Nov-2016) (NOV2019)
10 Write a macro which takes A, B, C, and D as parameters and calculates A=B+B*C+C*D.
(May2017)
11 Give suitable example for nested macro call with its data structure.(Jan-2013)(Oct-2016)
(Nov- 2017) (May-2017)
12 Give suitable example for macro by using conditional expansion or expansion time loops.
(Nov 2017)
13 Explain attributes of formal parameter and expansion time variable in macro. (Nov-2017)
14 Explain advanced macro programming facilities. Give examples. (Jan-2013)(Dec-
2015)(May- 2017)
15 Explain following advanced macro facilities: (i) Alteration of flow of control during
expansion
(ii) Expansion time variables (June-2013)
16 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. (Dec-2011) (May-2018)
17 Explain with examples - expansion time variables.(May-2014)
18 Explain following terms with suitable example. (May-2018) 1.Expansion time
variable 2. Positional parameter
19 Explain following facilities for expansion time loop with example.
(1) REPT statement (2) IRP statement (Nov-2016) (May-2016) (Dec-2018)
20 Define a macro taking starting_location and N as parameters to find summation of all N
numbers stored at locations starting from starting_location. The result is to be stored at
starting_location. (Jan-2013)
21 Write a macro that moves n numbers from the first operand to the second operand,
where n is specified as third operand of the macro. (May-2011)
22 Explain design specification tasks for macro pre-processor with suitable Example. (May-
2011)
23 Explain Design of Macro Pre-processor. (June-2013) (Dec-2015) (May-2012)(May-2017)
(May- 2019) (NOV-2019)
24 What is macro in programming language? Write an algorithm for macro definition. (May-
2012)
25 Draw a flow chart and explain simple one pass macro processor. (May-2012) (May-2016)

Page 10
 26 Discuss parameters for Activation Records. (May-2012)
Explain various data structures of Macro definition processing with example. (Dec-2011)
(Dec- 2013) (Jan 2021)
27 Explain use and field of following tables of macro.
KPDTAB, MDT, EVTAB, SSTAB (May-2016) (May-2018)(May-2019)
28 Explain following terms with suitable example.(1) Expansion time variable (3) Semantic
expansion
(2) Positional parameter (4) Macro Pre-processor (Nov-2017)
29 Explain in brief design of a macro assembler. (Oct-2016)(May-2017)
30 Compare and contrast macro pre-processor and macro assembler.(Oct-2016)(May-2017)
31 By taking the example of factorial program explain how activation record will look like for
every recursive in case of factorial. (May-2018)

Page 11
 CHAPTER 5 – Linkers and Loaders
System Software(3160715 )-Expected
1 Explain Linkers v/s Loaders
System Programming(2150708)- Old
1. Explain the concept and role of of linker and loader. (May-2019) (Jan 2021)
2. Draw flow chart of “program linking”. (Dec-2013)
3. Define the following terms: 1) Translation time address: 2) Linked time address 3)
Load time address: 4) Translated origin: 5) Linked origin: 6) Load origin: 7)
Interpreter(Nov-
2017)
4. What is program relocation? How relocation is performed by linker. Explain with example.
(May- 2014) (Dec-2014) (May-2016) (May-2017) (May-2018)
5 Explain object module of a program unit P in linker. (Dec-2013) (Nov-2016) (Jan 2021)
6 Explain relocation and linking requirements in segmented addressing with suitable example.
(June-2013)
7 What is program relocation? How relocation is performed by linker? Explain with example.
(Dec- 2015)
8 Explain self relocating program and overlay structured program. (Jan-2013)(Nov-2017)

(Oct- 2016) (Nov 2019)(Dec-2011)(May-2017)

9 What is program relocation? Explain characteristics of self-relocating programs. (Dec-2011)
10 Write a short note on MS-DOS Linker. (May-2011) (May-2014)
11 Write an algorithm for first pass of a linker. (Dec-2013)
12 What is overlay? Explain linking of overlay structured program. (May-2016)
13 What is an overlay? Explain overlay structured program and its execution (Dec-2011) (JAN
2021)
14 Explain dynamic linking. Draw the flaw chart for dynamic linking. (May-2012) (Dec-2018)
15 Write a brief note on MS-DOS linking and loading. (May-2011) (May-2012)
16 In brief explain relocating loader. (May-2016) (June-2013)

17 Explain following: Loader (Jan-2013) (May-2019) (Jan-2013) (May-2018)

18 Explain bootstrap loader.(Nov-2016)
19 Explain Absolute Loader with example. (May-2012)(Dec-2015)(May-2016) (Nov-
2016)(Nov- 2017) (Dec-2014) (Oct-2016)
20 Explain in detail, how the linker resolves the external references. (Jan 2021)

CHAPTER 6 – Scanning and Parsing

System Programming(2150708)- Old
1. 1. Define the following terms:
i. Context free grammar
ii. Regular grammar
iii. Context sensitive grammar
iv. Type-0 grammar (May-2019)
2. Write any Unambiguous grammar. How Ambiguity is removed from grammar? (May-2019)
Page 12
 3. What is grammar? Explain types of grammar. Write an unambiguous grammar for an
arithmetic expression containing the operators ↑ (exponentiation), +,*.(Dec-2014) (Jan
2021)
4. List and explain various types of grammar.(May-2014) (Dec-2015)
5 Explain types of grammar. (Dec-2013) (May-2016) (May-2018)
6 Construct DFA for following regular expression: (a* | b* )a*ab #. (Jan-2013)
7 Build a DFA for following regular expression. (a | b)*aab#. (June-2013)

Page 13
 8 Explain lexical analysis of a language processor. (Jan-2013)(May-2016)(May-2018)
9 Draw a DFA for the following Regular Expression. (a/b)* abb (Dec-2013)
10 Convert given regular expression to DFA. The expression is (a | b)*abb#. (May-2011)
11 Construct DFA for following regular expression: a* ( b* | c*) (a | c ) * # (Dec-2011)
12 Develop Regular expression and DFA for declaring a variable in ‘C’ lang. (May-2012)
13 Write a regular expression for the language consisting of all strings ending with 1 and does
not contain substring 00. Convert the resultant regular expression into Deterministic Finite
Automata.
(Dec-2014)
14 Write a regular expression for a language containing a binary string which does not
contain two consecutive 0s or two consecutive 1s anywhere. (Dec-2015)
15 Construct NFA and DFA for following regular expression: (0 | 1)*001# (Dec-2015)
16 Construct DFA for- 0*1*(0/1)# (Oct-2016) (May-2017)

17 Define regular expression and DFAs for following kinds of strings:

1. A real number with optional integer and fraction part.

2. A comment string in the C++ language. (Nov-2016)
18 Implement DFA from : a*(b* | c*)* b*d*# (May-2017)

19 Show that following regular expressions are equivalent by constructing optimized

DFA. (0/1)*
(0*/1*)* (May-2017)
20 Construct a deterministic finite automata for (0|1)*011.(Nov-2017)

21 Define the Parsing (June-2013)

22 Write regular expressions of a given language. The language consists of all strings of a’s and
b’s
which ends with a and does not contain bb. (May-2011)
23 State whether the following statements are true or false. Justify your answer. To make top-
down parsing feasible, it is necessary to eliminate left-recursion. (Dec-2013)
24 Constants and literals are two names having the same meaning. State true or false. (Dec-2013)
25 Define Handle, Grammar. (Nov-2016) (Dec-2013) (JAN 2021)
26 How to avoid backtracking in top down parsing? (Nov-2016) (June-2013)
State true/false: Top down parsers can never work with left recursive grammar.
(May-2017) (June-2013)
27 Write complete grammar for an arithmetic expression containing operators ‘+’, ‘–‘, ‘*’, ‘$’
using recursive specification and Backus Naur Form (BNF) where ‘$’ is exponentiation
operator. (June- 2013) (May-2019)
28 Write unambiguous production rules (grammar) for arithmetic expression Containing +, - , *,
/ and
^ (exponentiation). Construct parse tree and abstract syntax tree for :<id>–<id> * <id> ^ <id>
+
<id> (Dec-2011)
29 Given a grammar,

Page 14
 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). (May-2011) (Dec-2011) (Jan-2013) (May-2018)
(JAN2021)
30 Explain Left recursion, Left factoring and backtracking in top down parsing. (May-
2012)(Nov- 2016) (June-2013) (Oct-2016)

Page 15
 31 Perform left-fectoring on the following 04
grammar S = i E t S e S | i E t S | a
E = b(Dec-2013)
32 Explain left factoring by giving example. (Jan-2013) (May-2018) (JAN2021) 03
33 Remove left recursion from following production rules: A -> AaB | x , B -> BCb | y , C -> Cc 04
| epsilon (Jan-2013)
34 Parse following strings using given LL(1) parsing table (TABLE-I) 07
(i) id*id + id * id (ii) id + id + id + id

(June-2013)
35 By giving suitable example, illustrate working of operator precedence parser. (Jan-2013) 07
(Dec- 2013)
36 Write operator precedence table for arithmetic operators “+”, “*”, “-”, “/” .Parse 07,07,07
following expression using the table. id * id + id * id. (June-2013) (Nov-2016) (May-
2017) (nov 2019) (Dec-2011) (May-2018) (Oct-2016)
37 Explain recursive decent parser with suitable example. Also state its Drawbacks. 07
(June-2013) (Dec-2013) (Dec-2015)(May-2016)
38 Write unambiguous production rules to produce arithmetic expression consisting of +, -, 07
*, / , ^ (exponent), id. Use them for parsing id ^ id ^ id * id + id / id using shift -reduce
parser (Naïve bottom up parsing). Also lists limitation(s) of the method. (Jan-
2013)(Dec-2011)
39 Consider following grammar S -> aSbS | bSaS | epsilon Derive the string abab. Draw 07
corresponding parse tree. Are these rules ambiguous? Justify. (Jan-2013) (May-2017)

(Nov 2019)
40 A language consists of all strings of a’s and b’s which ends with b and does not contain aa. 07
Write regular expression for the language. (June-2013)
41 What is bottom up parser? Explain operator precedence parser. Let a grammar for a language 07
is E ✇E+E | E*E | id. Check validity of followingstring using stack based operator
precedence
parser. id * id + id * id (May-2011) (May-2012) (Nov 2019)
42 Given following expression = - (a+b) *(c+d) + (a+b+c) 07
1. Draw a Syntax tree for the expression
2. Write a three-address code for the expression
3. Give triple representation for the three address code of the expression (May-2014)
43 Perform lexical, syntax and semantic analysis on below C statement 07
a=b+c*d*100+e/f, Where data type of b, c & e are integers and remaining all variables are
float.
(May-2014) (Nov 2019)
44 Define Simple Phrase and Handle. Using Handle and Simple Phrase trace the bottom up 07
Page 16
 parsing algorithm.
Grammar is :
E ->T+ E | T – E | T
T ->T *V | T /
V | V V->a | b
|c|d
String is : a - b * c + d (May-2014) (Nov 2019)

Page 17
 45

(May-2014)
46 Given a grammar S→XS | dS | ε , X→Y | Zb | aY, Y→cZ , Z→e
Develop an LL(1) parsing table and check whether the string “dace” is accepted or not? (Dec-2014)
(May-2017)
47 Define following terms: 1. System Program 2. Language Processo 3. Parsing 4. Operator
Grammar
5. Handle 6. Assembler 7. Indirect Triple (Dec-2014)
48 Eliminate left recursion from following

grammar. S->A
A->Ad | Ae | aB | aC

B->bBC | f
C->g (Oct-2016) (May-2017)
49 Construct LL(1) parsing table for following

grammar. S-> iC tSeS | iCtS |a

C->b (May-2017) (Dec-2018)
50 Explain types of grammar in detail. (May-2017)

51 Define: L-Attributed definition in detail.(May-2018)

52 Write algorithm for practical approach of top down parsing.(Nov-2017) (Nov 2019)

53 Construct predictive parsing table for following

grammar: E->BA
A-> &BA|€
B->true|false. (Nov-2017)
54 Construct an operator precedence matrix for the operators of a grammar for
expressions containing arithmetic, relational and Boolean operator. (Nov-2017)
55 Explain Naïve Bottom up parsing algorithm with example and also mention which problem
occurs during parsing.(Nov-2017)
56 Draw the expression tree for the string f+(x+y)*((a+b)/(c-d)) by their evaluation order
and mention register required label in each node.(Nov-2017)
57 Define Lexical and Semantic Expansion. (Dec-2013) (Nov 2019)
58 Explain LEX in detail. (MAY-2019)(Dec-2018)
59 Explain YACC in detail.(MAY-2019)
60 Remove left recursion from following grammar A → Ac | Aad | bd | ε (Dec-2018)
Page 18
 CHAPTER 7 – Compilers
System Programming(2150708)- Old

Page 19
 1. Explain the Phases of Compiler.Give example(s) of errors detected by first three
phases of compiler. (Jan-2013) (May-2011)
2. Compare one pass and two pass compilers. Explain various parameter passing
mechanisms for functions. (Dec-2011)
3. Consider the statement a=b+c*10.where a, b, c are of type float. Show the translation of the given
statement
by different phases of compiler to produce assembly language statement. (Dec-2014)
4. Explain the terms Binding and Binding Times.(May-2018)
5 Write Three address codes and triple representation for x = x * y * z + x * y + y * z (Jan-
2013)
6 Show quadruple table for local optimization using value
numbers 14 g=25.2
15 x=z+2
16 h=x*y+d
: ……..
34 w=x*y (Dec-2013)
7 Explain methods for accessing non local variables. (Dec-2013)
8 How compiler implements scope rules? (Nov-2016)
9 Explain use of value number in local optimization.(Nov-2017)
10 List and compare various techniques for code optimization (Jan-2021)
11 Explain memory allocation in block structured language. (May-2011) (May-2018) (Jan
2021)
12 What is static and dynamic pointer in compiler? Explain working of display with
suitable example. (Nov-2016)
13 Explain in detail how the following input gets processed in toy
compiler. int a;
real b,c;
c=a+b*0.6; (Nov-2016)
14 Explain quadruple, triple and indirect triple with example. (May-2017) (Nov-2017)
(Oct-2016) (May-2018) (Jan 2021)
15 Which data structure is used for automatic dynamic allocation and memory access? Explain
with suitable example. (Nov-2017)
16 Explain operand descriptor and register descriptor for a*b.(Nov-2017)
17 Define the following terms. 1) Frequency reduction 2) triples (Dec-2013)
18 What is the need for code optimization? (Dec-2018)(May-2018)(Jan 2021)
19 What is meant by optimizing transformations? Explain any three with suitable example.
(June- 2013) (Jan-2013)(Dec-2015) (Dec-2014) (May-2017) (Jan 2021)
20 Explain various steps of code optimization with example. (May-2012) (Dec-2013)(May-
2017) (Dec-2011)
21 Given following expression: x = -a * b + -a * b

(1) Write three address codes for the expression.

(2) Optimize the three address code if it is possible to do so.
(3) Give triple implementation for the three address code of the expression. (May-2016)
22 Explain peephole optimization in detail. (Oct-2016)

Page 20
 23 Justify “Postfix string is a popular intermediate code in non optimizing compilers”(DEC-
2018)
24 Explain common sub expression elimination using value numbers.(Dec-2018)

25 Justify the statement, “The use of Type-3 production (grammar) is restricted to the
specification of lexical units”(Jan 2021)

Page 21
 26 Explain how Reference Count method assist memory management.(Jan 2021)

CHAPTER 8 – Interpreters and Debuggers

System Programming(2150708)- Old
1. What is interpreter? Explain benefits of interpreter. Compare interpreter and compiler. (Dec-
2015)
2. What is interpreter? Explain pure & impure interpreters. (May-2016)
What is pure and impure interpreter? (Nov-2016) (Nov-2017)
3. Explain functioning and componenet of interpreter. (Dec-2013)(Dec-2018)
4. Explain the drawbacks and benefits of Interpretation.(May-2018)
5 Explain Classification of Debugging. (Dec-2018)
6 What is debug monitor? (Jan 2021)
7 Explain design of an editor. (Nov-2016)

Prepared by: Ankita Shah

Page 22