Program: BE Computer Engineering

Curriculum Scheme: Revised 2016

Examination: Third Year Semester VI
Course Code: CSC602 and Course Name: System Programming and Compiler Construction
Time: 1 hour Max. Marks: 50
==============================================================================
=============================================================================
Note to the students:- All the Questions are compulsory and carry equal marks .

Q1. A software that helps programmer in finding logical errors in program through
partial execution is _______
Option A: Debugger
Option B: Compiler
Option C: Linker
Option D: Editor

Q2. A pseudo opcode that maps symbol in label field to the absolute value present in
operand field is ______
Option A: DC
Option B: EQU
Option C: MAP
Option D: ABS

Q3. Function of ASSUME statement in 8086 ALP (Assembly Language Program) is to

_____________
Option A: assign initial values to variable/ memory locations
Option B: map segment names to the base registers of 8086 microprocessor
Option C: assume default values of registers of 8086 microprocessor
Option D: assign literal values to memory locations

Q4. Instructions which do not occupy space in the object program are called _____ .
Option A: Declarative statements
Option B: Imperative statements
Option C: Assembler Directives
Option D: No Operation (NOP)

Q5. Which pseudo opcode indicates a register of IBM 360 is available as base
register?
Option A: USING
Option B: START
Option C: DC

1|Page
Option D: DS

Q6. In a two pass assembler the object code generation is done during the ?
Option A: Second pass
Option B: First pass
Option C: Zeroth pass
Option D: Not done by assembler

Q7. Macro is preferred when _______

Option A: the code block is large and occurs only once
Option B: the code block is small and repeats several times
Option C: the code block is large and repeats several times
Option D: the code block is small and occurs only once

Q8. Statements supported by conditional macro processor are

Option A: AIF
Option B: AGO
Option C: Both AIF and AGO
Option D: Neither AIF nor AGO

Q9. MDT is used to store

Option A: Formal parameters and index numbers
Option B: Actual parameters and index numbers
Option C: Macro name and MDTP
Option D: Definition of the Macro

Q10. Macro prototype statement specifies the.........

Option A: Definition of the Macro
Option B: Name of the Macro and list of formal parameters
Option C: Call of Macro
Option D: Macro substitution

Q11. In Absolute loading scheme, linking is done by _______

Option A: Programmer
Option B: Translator
Option C: Linker
Option D: Loader

Q12. In loader functions, relocation means ________

Option A: To move the program code and data into main memory
Option B: To assign new address to each module whenever the program executes
Option C: To change address in address sensitive instructions to load time address
Option D: To move a block of program to remote machine while it is executing

Q13. In Direct linking loader, absolute (load time) address of all modules and publicly
available symbols (symbols accessible to all modules) is stored in _________
2|Page
Option A: ESD
Option B: GEST
Option C: LESA
Option D: RLD

Q14. Which pseudo opcode indicates the list of symbols referred in the subroutine
but defined in other subroutines?
Option A: EXTRN
Option B: ENTRY
Option C: START
Option D: USING

Q15. Binder does not perform the function of ______

Option A: Allocation
Option B: Relocation
Option C: Linking
Option D: Loading

Q16. A system program that combines the separately compiled modules of a program
into a form suitable for execution
Option A: Assembler
Option B: Linker
Option C: Cross compiler
Option D: Load and go

Q17. Choose a string that does not belong to the language (a + bb)*.(b+aa)*
Option A: abbabbbaa
Option B: aabbaabb
Option C: aaab
Option D: abbba

Q18. Language recognized by a parser is __________

Option A: Regular
Option B: Context Sensitive
Option C: Context Free
Option D: Recursive

Q19. Predictive parser is a _____ parser

Option A: LL(0)
Option B: LL(1)
Option C: LR(0)
Option D: LR(1)

Q20. The number of tokens in the C statement sum = sum + i ; is

Option A: 3
Option B: 4
3|Page
Option C: 5
Option D: 6

Q21. Type checking is normally done during

Option A: Lexical Analysis
Option B: Syntax Analysis
Option C: Syntax Directed Translation
Option D: Code optimization

Q22. A top-down parser works on the principles of

Option A: Right most derivation
Option B: Rightmost derivation in reverse
Option C: Leftmost derivation
Option D: Leftmost derivation in reverse

Q23. An intermediate language should be

Option A: Machine dependent
Option B: Machine independent
Option C: close to source language in terms of syntax
Option D: same as assembly language of the processor

Q24. The optimization which avoids test at every iteration is

Option A: Loop unrolling
Option B: Loop jamming
Option C: Constant folding
Option D: Loop invariant reduction

Q25. Which of the following comment about peep-hole optimization is true?

Option A: It is applied to small part of the code and applied repeatedly
Option B: It is applied to optimize large loops that do not fit in memory
Option C: It can be applied to a portion of the code that is not contiguous
Option D: It is applied in symbol table to optimize the memory requirements

4|Page
These are sample MCQs to indicate pattern, may or
may not appear in examination

Mahatma Education Society’s

Pillai HOC College of Engineering and Technology

Program: BE Computer Engineering

Curriculum Scheme: Rev2016/2012
Examination: Third Year Semester V/VI
Course Code: CPC601and Course Name: System Programming Compiler Construction
Time: 1 hour Max. Marks: 50
Note to the students:- All the Questions are compulsory and carry equal marks .
Q1. In a two-pass assembler, the task of the Pass II is to
Option A: separate the symbol, mnemonic opcode and operand fields.
Option B: build the symbol table.
Option C: construct intermediate code.
Option D: synthesize the target program.

Q2. Which of these is not a part of Synthesis phase

Option A: Obtain machine code corresponding to the mnemonic from the Mnemonics table
Option B: Obtain address of a memory operand from the symbol table
Option C: Perform LC processing
Option D: Synthesize a machine instruction or the machine form of a constant

Q3. Which of the following coverts source program to code with .i extension?
Option A: Preprocessor
Option B: Compiler
Option C: Linker
Option D: Loader

Q4. Which of the following coverts assembly program to object code?

Option A: Assembler
Option B: Linker
Option C: Compiler
Option D: Preprocessor

Q5. Which of the following saves program in memory?

Option A: Loader
Option B: Compiler
Option C: Preprocessor
Option D: Linker
Q6. Relocatable programs
Option A: cannot be used with fixed partitions
Option B: can be loaded almost anywhere in memory
Option C: do not need a linker
Option D: can be loaded only at one specific location

Q7. A linker program

Option A: places the program in the memory for the purpose of execution.
Option B: relocates the program to execute from the specific memory area allocated to it.
Option C: links the program with other programs needed for its execution.
Option D: interfaces the program with the entities generating its input data.

Q8. Relocation bits used by relocating loader are specified by

Option A: Relocating loader itself
Option B: Assembler or Translator
Option C: Macro processor
Option D: Relocating loader and assembler

Q9. The translator which perform macro expansion is called a

Option A: Macro processor
Option B: Macro pre-processor
Option C: Micro pre-processor
Option D: assembler

Q10. We can design application program over-

Option A: System Program
Option B: Assembler
Option C: Linker
Option D: Loader

Q11. A model statement contains call for another macro is called as

Option A: Nested macro call
Option B: Referential macro call
Option C: inbuilt macro call
Option D: inherited macro call

Q12. The translator which perform macro expansion is called a

Option A: Macro Preprocessor
Option B: Macro Processor
Option C: Assembler
Option D: Linker

Q13. Arguments in macros are specified with

Option A: &
Option B: +
Option C: *
Option D: =
Q14. Which of the following is optional?
Option A: Label
Option B: Macro Definition
Option C: Macro Call
Option D: Arguments

Q15. In analyzing the compilation of PL/I program, the term "Machine independent
optimization" is assosiated with
Option A: recognization of basic syntactic construction through reductions
Option B: recognition of basic elements and creation of uniform symbols
Option C: creation of more optical matrix
Option D: use of macro-processor to produce more optimal assembly code

Q16. In analyzing the compilation of PL/I program the description " resolving symbolic
address ( lables ) and generating machine language " is associated with
Option A: assembly and output
Option B: code generation
Option C: storage assignment
Option D: syntax analysis

Q17. In analyzing the compilation of PL/I program the description " creation of more
optimal matrix " is assosiated with
Option A: assembly and output
Option B: code generation
Option C: syntax analysis
Option D: machine independent optimization

Q18. Peep-hole optimization is a form of

Option A: loop optimization
Option B: local optimization
Option C: constant folding
Option D: data flow analysis

Q19. Substitution of values for names whose values are constant, is done in
Option A: local optimization
Option B: loop optimization
Option C: constant folding
Option D: data flow analysis

Q20. How many phases of the compiler are there?

Option A: 6
Option B: 7
Option C: 5
Option D: 8
Q21. What is the rightendmarker of string?
Option A: $
Option B: *
Option C: +
Option D: What is the rightendmarker of string?

Q22. Which parser has smallest parsing table?

Option A: LALR
Option B: Canonocal
Option C: SLR
Option D: SR

Q23. Which of the following is not the type of three address code?
Option A: Tuples
Option B: Quadrapules
Option C: Triples
Option D: Indirect triples

Q24. Which one of the following is a top-down parser?

Option A: Recursive Descent Parser
Option B: LALR Parser
Option C: Operator Precedence Parser
Option D: LR Parser

Q25. Code redundancy is removed in-

Option A: Code Optimization
Option B: Code Generation
Option C: Intermediate code generation
Option D: Semantic analysis
Examination 2020 under cluster 9 (FAMT)
Program: TE Computer Engineering
Curriculum Scheme: Revised 2016
Examination: Third Year Semester VI
Course Code: CSC602 and Course Name: System Programming & Compiler Construction
Time: 1hour Max. Marks: 50
Note to the students:- All the Questions are compulsory and carry equal marks .

Q1. Data structures used in Assembler

Option A: MOT
Option B: MNT
Option C: MNTC
Option D: MDT

Q2. Location counter (LC) is used to

Option A: denote location of target code
Option B: denote location of source code
Option C: denote the location of current instruction being executed
Option D: denote location of branch instruction

Q3. Declarative statements are

Option A: used to declare beginning of thr program
Option B: used to declare storage
Option C: used to declare end of the program
Option D: used to debug the program

Q4. Effective error reporting in Assembler is

Option A: reporting error after pass II
Option B: reporting error after pass I
Option C: during writing Assembly code
Option D: during debuging the code

Q5. The technique of back patching is used in

Option A: two pass assembler
Option B: one pass assembler
Option C: Synthesis phase
Option D: Analysis phase

Q6. The end of a macro can be represented by the directive.

Option A: MEND
Option B: END
Option C: ENDS
Option D: ENDD
Q7. Output of macro processor is
Option A: Assembly code
Option B: macro code
Option C: object code
Option D: machine code

Q8. MDT is used to

Option A: store the body of the macro definitions
Option B: store the name of the defined macro
Option C: store the address of the nacro name
Option D: store the arguments to macro definition

Q9. Which is not a data structure of macro processor

Option A: Symbol table
Option B: MNT
Option C: MDT
Option D: MNTC

Q10. Which of the following system software always resides in the main memory ?
Option A: Text Editor
Option B: Assembler
Option C: Linker
Option D: Loader

Q11. Which is not a function of a loader

Option A: allocation
Option B: translation
Option C: relocation
Option D: loading

If linked origin is not equal to translated address then relocation is performed

Q12. by____________.
Option A: Absolute Loader
Option B: Loader
Option C: Linker
Option D: cross compiler

While evaluating a postfix expression, when an operator is encountered, what is the correct
Q13. operation to be performed?
Option A: push it directly on to the stack
Option B: pop 2 operands, evaluate them and push the result on to the stack
Option C: pop the entire stack
Option D: ignore the operator
Q14. What is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.
Option A: 4
Option B: 5
Option C: 6
Option D: 7

Q15. The method which merges the bodies of two loops is

Option A: loop rolling
Option B: loop Jamming
Option C: constant folding
Option D: Loop unrolling

Q16. Three address statement is abstract form of ________

Option A: Source program
Option B: Intermediate code
Option C: Target program
Option D: Object Code

______________ is used to generate code for boolean expression and flow of control
Q17. statements in one pass.
Option A: Backpatching
Option B: Code-generator
Option C: Parser
Option D: Static checker

Q18. Local and loop optimization in turn provide motivation for

Option A: Data flow analysis
Option B: Constant folding
Option C: Peephole optimization
Option D: DFA and constant folding

Q19. A compiler program written in a high level language is called

Option A: object program
Option B: machine language program
Option C: none of these
Option D: source program

Q20. The top down parser generates

Option A: right most derivation
Option B: right most derivation in reverse
Option C: left most derivation
Option D: left most derivation in reverse
Q21. What goes over the characters of the lexeme to produce a value?
Option A: Scanner
Option B: Parser
Option C: Evaluator
Option D: Lexical generator

Q22. The most powerful parser is

Option A: SLR
Option B: Canonical LR
Option C: LALR
Option D: Operator-precedence

Q23. Substitution of values for names whose values are constant, is done in
Option A: loop optimization
Option B: constant folding
Option C: local optimization
Option D: Constant propogation

Q24. Access time of the symbol table will be logarithmic,if it is implemented by

Option A: linear list
Option B: hash table
Option C: self-organizing list
Option D: search tree

A shift reduce parser carries out the actions specified within braces immediately after
reducing,with
the corresponding rule of the grammar

s->xxW{print “1”}
s->y{print “2”}
w->sz{print “3”}

Q25. what is the translation of “xxxxyzz” ?

Option A:
11231
Option B: 11233
Option C: 23131
Option D:
233321
 University of Mumbai
Examination 2020 under cluster ___ (Lead College Shortname)

Program: Computer Engineering

Curriculum Scheme: Rev2016
Examination: Third Year Semester-VI
Course Code: CSC602 and Course Name: System Programming And Compiler Construction
Time: 1hour Max. Marks: 50
=====================================================================
=====================================================================
Note to the students:- All the Questions are compulsory and carry equal marks .
Q1. A grammar that produces more than one parse tree for some sentence is called
__________
Option A: Unambiguous
Option B: Regular
Option C: Ambiguous
Option D: Non-regular

Q2. A bottom up parser generates __________

Option A: Right most derivation
Option B: Rightmost derivation in reverse
Option C: Leftmost derivation
Option D: Leftmost derivation in reverse

Q3. A top down parser generates __________

Option A: Rightmost Derivation
Option B: Right most derivation in reverse
Option C: Left most derivation
Option D: Left most derivation in reverse

Q4.
Which of the following groups is/are token together into semantic structures?
Option A: Syntax analyzer

1|Page
 University of Mumbai
Examination 2020 under cluster ___ (Lead College Shortname)

Option B: Intermediate code generation

Option C: Lexical analyzer
Option D: Semantic analyzer

Q5. Grammar of the programming is checked at _______ phase of compiler.

Option A: Semantic analysis
Option B: Syntax analysis
Option C: Code optimization
Option D: Code generation

Q6. _________ is a process of finding a parse tree for a string of tokens.

Option A: Parsing
Option B: Analysing
Option C: Recognizing
Option D: Tokenizing

Q7. What is the name of the process that determining whether a string of tokens can
be generated by a grammar?
Option A: Analysing
Option B: Parsing
Option C: Translating
Option D: Recognizing

Q8. Identify positional parameter in given macro code:

MACRO
INCR &ARG0, &ARG1=X
ADD ARG, &ARG0
ADD ARG, &ARG1

MEND
Option A: &ARG0
Option B: &ARG1

2|Page
 University of Mumbai
Examination 2020 under cluster ___ (Lead College Shortname)

Option C: ADD
Option D: ARG

Q9. Which table holds the names of all macros defined in the program ?
Option A: Actual Parameter Table
Option B: Macro definition Table
Option C: Expansion Time Variable
Option D: Macro Name Table

Q10. The syntax of formal parameter specification is

Option A: <parameter name>[[<default value>]
Option B: & <parameter name>[<parameter kind>[<default value>]]
Option C: <parameter name>[<parameter kind>[<default value>]]
Option D: <parameter name>[<parameter kind>]

Q11. A system program that combines the separately compiled modules of a program
into a form suitable for execution ?
Option A: Assembler
Option B: Linking loader
Option C: Cross compiler
Option D: Load and Go

Q12. Load address for the first word of the program is called
Option A: Linker address origin
Option B: Load address origin
Option C: Phase library
Option D: Absolute library

Q13. Relocatable programs

3|Page
 University of Mumbai
Examination 2020 under cluster ___ (Lead College Shortname)

Option A: cannot be used with fixed partitions

Option B: can be loaded almost anywhere in memory
Option C: do not need a linker
Option D: can be loaded only at one specific location

Q14. In a two pass assembler the object code generation is done during the ?
Option A: Second pass
Option B: First pass
Option C: Zeroeth pass
Option D: Not done by assembler

Q15. Which of the following is not a type of assembler?

Option A: one pass
Option B: Two pass
Option C: Three pass
Option D: load and go

Q16. In a two pass assembler, adding literals to literal table and address resolution of
local symbols are done using ?
Option A: First pass and second respectively
Option B: Both second pass
Option C: Second pass and first respectively
Option D: Both first pass

Q17. Which of the following system program foregoes the production of object code to
generate absolute machine code and load it into the physical main storage location
from which it will be executed immediately upon completion of the assembly ?
Option A: Macro processor
Option B: Load and go assembler
Option C: Two pass assembler

4|Page
 University of Mumbai
Examination 2020 under cluster ___ (Lead College Shortname)

Option D: Compiler

Q18. An assembler is
Option A: programming language dependent
Option B: syntax dependant
Option C: machine dependant
Option D: data dependant

Q19. Three address code involves

Option A: Exactly 3 address

Option B: Exactly 2 address

Option C: At most most 3 address
Option D: No unary operators

Q20. Which of the following is not An intermediate code form

Option A: Postfix notation
Option B: Syntax trees
Option C: Three address code
Option D: Infix notation

Q21. Reduction in strength means

Option A: Replacing run time computation by compile time computation
Option B: Removing loop invariant computation
Option C: Removing common sub expression
Option D: Replacing a costly operation by a relatively cheaper one

Q22. Intermediate code generation phase gets input from

Option A: Lexical analyzer
Option B: Syntax analyzer

5|Page
 University of Mumbai
Examination 2020 under cluster ___ (Lead College Shortname)

Option C: Semantic analyzer

Option D: Error handling

Q23. The optimization which avoids test at every iteration is

Option A: Loop unrolling
Option B: Loop jamming
Option C: Constant folding
Option D: Removing common sub expression

Q24. The _________ graph shows the basic blocks and their successor relationship
Option A: Flow
Option B: Control
Option C: DAG
Option D: Hamilton

Q25. A compiler that runs on one machine and produces code for a different machine is
called________
Option A: Cross Compiler
Option B: One Pass Compiler
Option C: Two Pass Compiler
Option D: Just In Time Compiler

6|Page
 Program: BE Computer Engineering
Curriculum Scheme: Revised 2012
Examination: Third Year Semester VI (SAMPLE PAPER)
Course Code: CPC601 and Course Name: System Programming And Compiler
Construction
Time: 1 hour
Max. Marks: 50
==============================================================================
=============================================================================
Note to the students:- All the Questions are compulsory and carry equal marks .

Q1. Which of the following is the fastest logic?

Option A: TTL

Option B: ECL

Option C: CMOS

Option D: LSI

Q2. A bottom up parser generates __________

Option A: Right most derivation
Option B: Rightmost derivation in reverse
Option C: Leftmost derivation
Option D: Leftmost derivation in reverse

Q3. A grammar that produces more than one parse tree for some sentence is
called __________

Option A: Ambiguous
Option B: Unambiguous
Option C: Regular
Option D: None of the mentioned

Q4. An optimizer Compiler __________

Option A: Is optimized to occupy less space
Option B: Is optimized to occupy less space & Optimize the code
Option C: Optimize the code
Option D: None of the mentioned

Q5. The linker __________

Option A: Is similar to interpreter

1 | Page
Option B: Uses source code as its input
Option C: Is required to create a load module
Option D: None of the mentioned

Q6. Pee Hole optimization __________

Option A: Loop Optimization
Option B: Local Optimization
Option C: Constant folding
Option D: Data Flow analysis

Q7. The optimization which avoids test at every iteration is?

Option A: Loop unrolling
Option B: Loop jamming
Option C: Constant folding
Option D: None of the mentioned

Q8. Shift reduce parsers are __________

Option A: Top down Parser
Option B: Bottom Up parser
Option C: May be top down or bottom up
Option D: None of the mentioned

Q9. An intermediate code form is __________

Option A: Postfix notation
Option B: Syntax Trees
Option C: Three Address code
Option D: All of the mentioned

Q10. Which of the following actions an operator precedence parser may take to
recover from an error?
Option A: Insert symbols onto the stack
Option B: Delete symbols from the stack
Option C: Inserting or deleting symbols from the input
Option D: All of the mentioned

Q11. What is the output of lexical analyzer?

Option A: Parse
Option B: Code optimization
Option C: Code generator
Option D: Lexical analyser

Q12. Shift reduce parsers are __________

Option A: Top down parser
Option B: Bottom up parser
Option C: Maybe both
Option D: None of the mentioned

2 | Page
Q13. A bottom up parser generates __________
Option A: Right most derivation
Option B: Right most derivation in reverse
Option C: Left most derivation
Option D: Left most derivation in reverse

Q14. What is garbage?

Option A: Unallocated storage
Option B: Allocated storage whose access paths are destroyed
Option C: Allocated storage
Option D: Uninitialized storage

Q15. An optimizing compiler __________

Option A: Is optimized to occupy less space
Option B: Is optimized to take less time for execution
Option C: Optimized the code
Option D: None of the mentioned

Q16. Which of the following symbols table implementation is based on the property
of locality of reference?
Option A: Hash Table
Option B: Search tree
Option C: Self organizing list
Option D: Linear list

Q17. The circuit converting binary data in to decimal is_____

Option A: Encoder
Option B: Multiplexer
Option C: Decoder
Option D: Code converter

Q18. In computers, subtraction is carried out generally by __________

Option A: 1’s complement method
Option B: 2’s complement method
Option C: signed magnitude method
Option D: BCD subtraction method

Q19. In a two pass assembler the object code generation is done during the ?
Option A: Second pass
Option B: First pass
Option C: Zeroeth pass
Option D: Not done by assembler

Q20. Which of the following is not a type of assembler ?

Option A: one pass

3 | Page
Option B: two pass
Option C: three pass
Option D: load and go

Q21. In a two pass assembler, adding literals to literal table and address resolution of
local symbols are done using ?
Option A: First pass and second respectively
Option B: Both second pass
Option C: Second pass and first respectively
Option D: Both first pass

Q22.
Translator for low level programming language were termed as

Option A: Assembler
Option B: Compiler
Option C: Linker
Option D: Loader

Q23. An assembler is
Option A: programming language dependent
Option B: syntax dependant
Option C: machine dependant
Option D: data dependant

Q24. In a two-pass assembler, the task of the Pass II is to

Option A: separate the symbol, mnemonic opcode and operand fields.
Option B: build the symbol table.
Option C: construct intermediate code.
Option D: synthesize the target program.

Q25. TII stands for

Option A: Table of incomplete instructions
Option B: Table of information instructions
Option C: Translation of instructions information
Option D: Translation of information instruction

4 | Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)

Program: Computer Engineering

Curriculum Scheme: Rev2016
Examination: Third YearSemester VI
Course Code: CSC602and Course Name: System Programming and Compiler Construction
Time: 1 hour Max. Marks: 50
=====================================================================

For the students:- All the Questions are compulsory and carry equal marks .
Q1. Which one of the following is TRUE at any valid state in shift – reduce parsing?
Option A: Viable prefixes appear only at the bottom of the stack and not inside
Option B: Viable prefixes appear only at the top of the stack and not inside
Option C: The stack contains only a set of viable prefixes
Option D: The stack never contains viable prefixes

Q2. Assembler is_________

Option A: programming language dependent
Option B: syntax dependant
Option C: machine dependant
Option D: data dependant

Q3. The last statement of the assembly program should be _______

Option A: END
Option B: RETURN
Option C: STOP
Option D: TERMINATE

Q4. The end of a macro can be represented by the directive

Option A: END
Option B: ENDS
Option C: MEND
Option D: ENDD

Q5. Which of the following statements is incorrect?

Option A: Complete code of instruction string is inserted at each place, wherever the macro
name appears
Option B: Macro requires less time of execution than that of procedure
Option C: Macro uses stack memory
Option D: Macro name can be anything except registers and mnemonics

Q6. Which is not a function of a loader?

Option A: allocation
Option B: translation

1|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)

Option C: relocation
Option D: loading

Q7. Which of the following data structure is used by Dynamic Linking loader?
Option A: Public & Extern table
Option B: Transfer Vector table
Option C: Literal table
Option D: Argument List Array table

Q8. Which are the facility not provided by debug monitor?

Option A: Setting breakpoints in programs
Option B: Automated test driver
Option C: Display value of variable
Option D: Testing user defined assertion and predict involving programs variable

Q9. Grammar of the programming is checked at _______ phase of compiler

Option A: Semantic analysis
Option B: Syntax analysis
Option C: Code generation
Option D: Code optimization

Q10. Which of the following are Lexemes?

Option A: Identifiers
Option B: Constants
Option C: Keywords
Option D: ALL A,B,C

Q11. Consider the grammar with non-terminals N = {S,C,S1}, terminals T = {a, b, i, t,

e}, with S as the start symbol, and the following set of rules:

S → iCtSS1 | a
S1 → eS | ε
C→b

The grammar is NOT LL(1) because:

Option A: it is left recursive.
Option B: it is right recursive.
Option C: it is ambiguous.
Option D: it is not context-free.

Q12. Consider the following two statements:

P: Every regular grammar is LL(1)

2|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)

Q: Every regular set has a LR(1) grammar

Which of the following is TRUE?

Option A: Both P and Q are true
Option B: P is true and Q is false
Option C: P is false and Q is true
Option D: Both P and Q are false

Q13. What is the maximum number of reduce moves that can be taken by a bottom-up
parser for a grammar with no epsilon- and unit-production (i.e., of type A→ϵ and
A→a) to parse a string with n tokens?
Option A: n/2
Option B: n-1
Option C: 2n
Option D: 2n-1

Q14. Which of the following is essential for converting an infix expression to the
postfix from efficiently?
Option A: An operator stack
Option B: An operand stack
Option C: An operand stack and an operator stack
Option D: A parse tree

Q15. Which of the following is used to represent Three-Address Code?

Option A: Indirect Triples
Option B: Activation Record
Option C: Symbol table
Option D: Stack

Q16. Which of the following is called the subsequent filling of the labels when they are
determined?
Option A: Backpatching
Option B: Bootstrapping
Option C: Parsing
Option D: Forward patching

Q17. Which of the following is the graphical representation of three address statements?
Option A: Quadruples
Option B: Flow graph
Option C: Basic block
Option D: DFD

Q18. Which of the following is not applicable for DAG?

3|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)

Option A: used for common subexpression elimination

Option B: To determine which identifiers have values used in the block
Option C: To determine which statements can compute values that can be used
outside the blocks
Option D: To identify tokens
loop Constant Copy Dead-code
optimisation folding propagation elimination
Q19. Consider the following statements: a = 6*3 => a = 18. Which of the following
transformation is applicable?
Option A: loop optimisation
Option B: Constant folding
Option C: Copy propagation
Option D: Dead-code elimination

Q20. Which of the following is not the example of function- preserving transformation?
Option A: Common subexpression elimination
Option B: Constant folding
Option C: Code motion
Option D: Dead-code elimination

Q21. The leaf nodes of a DAG are labelled by which of the following?
Option A: unique identifiers
Option B: operators
Option C: comments
Option D: intermediate computations

Q22. How many fields are present in quadruples?

Option A: 4
Option B: 3
Option C: 5
Option D: 2

Q23. Type checking is normally done during_______

Option A: Lexical analysis
Option B: Syntax analysis
Option C: Syntax directed translation
Option D: Code optimization

Q24. Which one of the following kinds of derivation is used by LR parsers?

Option A: Rightmost
Option B: Leftmost
Option C: Rightmost in reverse
Option D: Leftmost in reverse
4|Page
 University of Mumbai
Examination 2020 under cluster 3 (FCRIT)

Q25. Which of the following software always resides in main memory?

Option A: Text editor
Option B: Assembler
Option C: Linker
Option D: Loader

Principal

5|Page