CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

An important component of semantic analysis is _________ .

type checking

code checking

flush checking

None of the given

2 / 50

_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.

Start

Front end

Back end

None of given

3 / 50

We can get an LL(1) grammar by _______ .

Removing left recurrence and Applying left factoring

Removing left recurrence

None of the given

Applying left factoring

4 / 50

Left factoring of a grammar is done to save the parser from back tracking.

FALSE

TRUE

5 / 50

In Back End module of compiler, optimal register allocation uses______ .

None of the given

N P-Complete

O(n log n)

O(log n)

6 / 50

In a transition table cells of the table contain the ________ state.

Previous state

Reject state

None of the given

Next state

7 / 50

Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.

De-allocation of memory

Shift action

Reduce action

Shift and reduce actions

8 / 50

Functions of Lexical analyzer are?

Removing white space

All of the given

Removing comments

Removing constants, identifiers and keywords

9 / 50

The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.

{0,1}

{0,1,2,3}

{0,1,2}

{0}

10 / 50

In multi pass compiler during the first pass it gathers information about __________ .

Static information

Declaration

None of the given

Bindings

11 / 50

When generating a lexical analyzer from a token description, the item sets (states) are constructed by two types of “moves”: character moves and ____ moves.

none of given

12 / 50

Consider the following grammar,

h, g, i

None of the given

13 / 50

This grammar contains a reduce-reduce conflict. If a DFA states contains both [X → α •, a] and [Y → β •, a], then on input “a” we don’t know which production to reduce with. This is called a reduce-reduce conflict. Usually due to gross ambiguity in the grammar.

TRUE

FALSE

14 / 50

We use ----- to mark the bottom of the stack and also the right end of the input when considering the Stack implementation of Shift-Reduce Parsing.

Epsilon

None of the given

15 / 50

Yacc contains built-in support for handling ambiguous grammars resulting in _______

conflicts.

Shift-second

Shift-Shift

Shift-reduce

16 / 50

Parser always gives a tree like structure as output

FALSE

TRUE

17 / 50

In compilation process Hierarchical analysis is also called

None of given

Both Parsing and Syntax analysis

Parsing

Syntax analysis

18 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction selection

Instruction scheduling

None of given

19 / 50

Optimal registers allocation is an NP-hard problem.

FALSE

TRUE

20 / 50

Reduction of a handle to the ------- on the left hand side of the grammar rule is a step along the reverse of a right most derivation.

Non-terminal

Terminal

21 / 50

Recursive ____________ parsing is done for LL(1) grammar.

Ascent

Backward

Forward

Decent

22 / 50

___________ phase which supports macro substitution and conditional compilation.

Syntax

None

Preprocessing

Semantic

23 / 50

Which of the statement is true about Regular Languages?

Regular Languages are easy to understand.

Regular Languages are based on simple and useful theory.

Regular Languages are the most popular for specifying tokens.

All of the given

24 / 50

Left factoring of a grammar is done to save the parser from back tracking.

TRUE

FALSE

25 / 50

Left factoring is enough to make LL1 grammar

FALSE

TRUE

26 / 50

The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.

{0,1}

{0,1,2,3}

{0}

{0,1,2}

27 / 50

NFA is easy to implement as compared to DFA.

TRUE

FALSE

28 / 50

Front end of two pass compiler takes________ as input.

None

Intermediate representation

Source code

Machine code

29 / 50

One of the core tasks of compiler is to generate fast and compact executable code.

FALSE

TRUE

30 / 50

_______ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.

Start

Back end

None of given

Front end

31 / 50

____is evaluated to yield a value.

Expression

Declaration

Declaration and Command

Command

32 / 50

Left factoring is enough to make LL1 grammar

FALSE

TRUE

33 / 50

LL(1) parsing is called non-predictive parsing.

FALSE

TRUE

34 / 50

NFA is easy to implement as compared to DFA.

TRUE

FALSE

35 / 50

The regular expressions a*|b* and (a|b)* describe the _____set of strings.

Same

Onto

Different

36 / 50

For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.

FALSE

TRUE

37 / 50

____________avoid hardware stalls and interlocks.

Instruction selection

Instruction scheduling

None of given

38 / 50

Lexer and scanner are two different phases of compiler

FALSE

TRUE

39 / 50

Flex is an automated tool that is used to get the minimized DFA (scanner).

TRUE

FALSE

40 / 50

LL(1) parsing is called non-predictive parsing.

FALSE

TRUE

41 / 50

In Three-pass compiler ____ is used for code improvement or optimization.

Back End

Middle End

Both Front end and Back end

Front End

42 / 50

45.Follow of C is ____ .

g, h, i, $

g, h, $

h, i, $

h, g, $

43 / 50

Can a DFA simulate NFA?

Yes

Sometimes

44 / 50

_______ algorithm is used in DFA minimization.

Hopcroft’s

Robert‟s

James‟s

None of given

45 / 50

Parser takes tokens from scanner and tries to generate ______ .

None of the given

Binary Search tree

Parse tree

Syntax trace

46 / 50

_____ convert the reloadable machine code into absolute machine code by linking library and reloadable object files.

Compiler

Loader/link-editor

Preprocessor

Assembler

47 / 50

Follow of B is ____ .

g, i

g, h, i, $

48 / 50

AST summarizes the grammatical structure with the details of derivations.

FALSE

TRUE

49 / 50

The non-terminal _______ is left recursive.

None of the given

50 / 50

LR parsers can handle _______ grammars.

End-recursive

Left-recursive

file-recursive

Start-recursive

Your score is

The average score is 0%