UGC NET-CS - SYSTEM SOFTWARE AND COMPILERS

Paper II
June 2015
1.

2.The translator which performs macro calls expansion is called :

(1) Macro processor (2) Micro pre processor (3) Macro pre - processor (4) Dynamic Linker
3.

4.

5.Which phase of compiler generates stream of atoms ?

(1) Syntax Analysis (2) Lexical Analysis (3) Code Generation (4) Code Optimization
December 2014
6.Shift-Reduce parsers perform the following :
(A) Shift step that advances in the input stream by K(K > 1) symbols and Reduce step
that applies a completed grammar rule to some recent parse trees, joining them
together as one tree with a new root symbol.
(B) Shift step that advances in the input stream by one symbol and Reduce step that
applies a completed grammar rule to some recent parse trees, joining them together
as one tree with a new root symbol.
(C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step
that applies a completed grammar rule to form a single tree.
(D) Shift step that does not advance in the input stream and Reduce step that applies a
completed grammar rule to form a single tree.
7.Which of the following is true ?
(A) Canonical LR parser is LR (1) parser with single look ahead terminal
(B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers.
(C) Both (A) and (B)
(D) None of the above
8.In a two-pass assembler, symbol table is
(A) Generated in first pass
(B) Generated in second pass
(C) Not generated at all
(D) Generated and used only in second pass
9.Debugger is a program that
(A) allows to examine and modify the contents of registers
(B) does not allow execution of a segment of program
(C) allows to set breakpoints, execute a segment of program and display contents of
register
(D) All of the above
June 2014
10.A grammar G is LL(1) if and only if the following conditions hold for two distinct productions
A|
I.
First () First () {a} where a is some terminal symbol of the grammar.
II. First () First ()
III. First () Follow (A) = if First ()
(A) I and II (B) I and III (C) II and III (D) I, II and III
11.Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?
(A) Removing left recursion alone (B) Removing the grammar alone
(C) Removing left recursion and factoring the grammar (D) None of the above
12.A shift reduce parser suffers from
(A) shift reduce conflict only (B) reduce reduce conflict only
(C) both shift reduce conflict and reduce reduce conflict
(D) shift handle and reduce handle conflicts
December 2013
13.Given the following statements :
S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-
aheads are associated with the items and they make use of the left context available to the parser.
S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR
grammars.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.
14.The process of assigning load addresses to the various parts of the program and adjusting the
code and data in the program to reflect the assigned addresses is called _______.
(A) Symbol resolution (B) Parsing (C) Assembly (D) Relocation
15.Which of the following derivations does a top-down parser use while parsing an input string ?
The input is scanned from left to right.
(A) Leftmost derivation (B) Leftmost derivation traced out in reverse
(C) Rightmost derivation traced out in reverse (D) Rightmost derivation
September 2013
16.

June 2013
17.

18.
19.

December2012
20.In compiler design reducing the strength refers to
(A) reducing the range of values of input variables.
(B) code optimization using cheaper machine instructions.
(C) reducing efficiency of program. (D) None of the above
21.

22.Which of thefollowing is true while converting CFG to LL(I) grammar ?

(A) Remove left recursion alone (B) Factoring grammar alone
(C) Both of the above (D) None of the above
23.Which of the following is the most powerful parring method ?
(A) LL(I) (B) Canonical LR (C) SLR (D) LALR
December 2010
24.Object code is the output of ______.
(A) Operating System(B) Compiler or Assembler (C) only Assembler (D) only Compiler
25.Macro in an assembly levelprogram is _______.
(A) sub program (B) a complete program
(C) a hardware portion (D) relative coding
26.Grammar of the programming is checked at ________ phase of compiler.
(A) semantic analysis (B) code generation (C) syntax analysis (D) code optimization
27.Macro-processors are ______.
(A) Hardware (B) Compiler (C) Registers (D) None of the above
June 2010
28.In an absolute loading scheme, which loader function is accomplished by a loader ?
(A) Re-allocation (B) Allocation (C) Linking (D) Loading
29.

30.Consider the following left associative operators in decreasing order of precedence :

subtraction (highest precedence) * multiplication $ exponentiation (lowest precedence)
What is the result of the following expression ?
3 2 * 4 $ | * 2**3
(A) 61 (B) 64 (C) 512 (D) 4096
31.Which of the following is the most general phase structured grammar ?
(A) Regular (B) Context-sensitive (C) Context free (D) None of the above
32.Which of the following is used for grouping of characters into tokens (in a computer) ?
(A) A parser (B) Code optimizer (C) Code generator (D) Scanner
December 2009
33. In an absolute loading scheme which loader function is accomplished by assembler ?
(A) re-allocation (B) allocation (C) linking (D) loading
34. Which of the following grammar is LR (1) ?
(A) A a A b, A b A b, A a , A b
(B) A a A a, A a A b, A c
(C) A A + A, A a
(D) Both (A) and (B)
35. A shift-reduce parser carries out the actions specified within braces immediately after
reducing with the corresponding rule of the grammar.
S x x W [ print 1]
S y [print 2]
W S2 [print 3], what is the translation of x x x x y z z ?
(A) 1 1 2 3 1 (B) 1 1 2 3 3 (C) 2 3 1 3 1 (D) 2 3 3 2 1
36. Contex-free Grammar (CFG) can be recognized by
(A) Finite state automata (B) 2-way linear bounded automata
(C) push down automata (D) both (B) and (C)
37. Synthesized attribute can be easily simulated by a
(A) LL grammar (B) Ambiguous grammar (C) LR grammar (D) None of the above
June 2009
38.The linker :
(A) is similar to interpreter (B) uses source code as its input
(C) is required to create a load module (D) none of the above
39. A compiler that runs on one machine and produces code for a different machine is called :
(A) Cross compilation (B) One pass compilation
(C) Two pass compilation (D) None of the above
40.Any syntactic construct that can be described by a regular expression can also be described by a :
(A) Context sensitive grammar (B) Non context free grammar
(C) Context free grammar (D) None of the above