CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

In compilation process Hierarchical analysis is also called-----------

Syntax analysis

Both Parsing and Syntax analysis

Parsing

None of given

2 / 50

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

Forward

Decent

Ascent

3 / 50

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

Grammar

Character

Token

Sentence

4 / 50

____________avoid hardware stalls and interlocks.

Instruction selection

None of given

Instruction scheduling

5 / 50

Intermediate Representation (IR) stores the value of its operand in

Secondary storage

Memory

Registers

Hard disk

6 / 50

LR parsers can handle _______ grammars.

End-recursive

Start-recursive

file-recursive

Left-recursive

7 / 50

Bottom-up parsers handle a ________ class of grammars.

Large

none of the given

small

medium

8 / 50

_______ algorithm is used in DFA minimization.

Hopcroft’s

James‟s

Robert‟s

None of given

9 / 50

Can a DFA simulate NFA?

Yes

Sometimes

10 / 50

LR parsers can handle _______ grammars.

file-recursive

End-recursive

Left-recursive

Start-recursive

11 / 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}

12 / 50

Optimal registers allocation is an NP-hard problem.

TRUE

FALSE

13 / 50

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

FALSE

TRUE

14 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction selection

Instruction scheduling

None of given

15 / 50

Ambiguity can easily be handled by Top-down Parser Select correct option:

TRUE

FALSE

16 / 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.

FALSE

TRUE

17 / 50

Functions of Lexical analyzer are?

Removing white space

All of the given

Removing constants, identifiers and keywords

Removing comments

18 / 50

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

Backward

Ascent

Forward

Decent

19 / 50

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

Backward

Forward

Decent

Ascent

20 / 50

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

FALSE

TRUE

21 / 50

Front end of two pass compiler takes________ as input.

Intermediate Representation (IR)

Machine Code

None of the Given

Source code

22 / 50

An important component of semantic analysis is _________ .

type checking

flush checking

None of the given

code checking

23 / 50

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

Start

Front end

None of given

Back end

24 / 50

Functions of Lexical analyzer are?

Removing white space

Removing comments

All of the given

Removing constants, identifiers and keywords

25 / 50

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

Removing left recurrence

None of the given

Applying left factoring

Removing left recurrence and Applying left factoring

26 / 50

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

Front End

Back End

Middle End

Both Front end and Back end

27 / 50

_______ algorithm is used in DFA minimization.

James’s

Robert’s

None of given

Hopcroft’s

28 / 50

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

TRUE

FALSE

29 / 50

An important component of semantic analysis is _________ .

type checking

code checking

None of the given

flush checking

30 / 50

___________ phase which supports macro substitution and conditional compilation.

Syntax

Preprocessing

None

Semantic

31 / 50

Consider the grammar

h, g, $

g, h, i, $

h, i, $

g, h, $

32 / 50

In compilation process Hierarchical analysis is also called

Syntax analysis

None of given

Parsing

Both Parsing and Syntax analysis

33 / 50

In predictive parsing table the rows are ___________ .

Terminals

None of the given

Both non-terminal and terminals

Non-terminals

34 / 50

In predictive parsing table the rows are ___________ .

None of the given

Non-terminals

Both non-terminal and terminals

Terminals

35 / 50

Front-end of a two pass compiler is consists of Scanner.

FALSE

TRUE

36 / 50

Follow of B is ____ .

g, i

g, h, i, $

37 / 50

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

Bindings

Static information

None of the given

Declaration

38 / 50

In LL1() parsing algorithm _________ contains a sequence of grammar symbols.

Array

Stack

None

Link list

39 / 50

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

Middle End

Front End

Both Front end and Back end

Back End

40 / 50

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

None of the given

Reject state

Previous state

Next state

41 / 50

In parser the two LL stand(s) for ____________ .

None of the given

Left-to-right scan of input

All of the given

left-most derivation

42 / 50

Consider the grammar

g, h, i, $

g, i

43 / 50

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

Removing left recurrence

None of the given

Removing left recurrence and Applying left factoring

Applying left factoring

44 / 50

45.Follow of C is ____ .

g, h, $

h, g, $

g, h, i, $

h, i, $

45 / 50

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

TRUE

FALSE

46 / 50

In PASCAL ___________ represent the inequality test.

47 / 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

48 / 50

Lexical Analyzer generator _______ is written in Java.

Jlex

Complex

Flex

None of given

49 / 50

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

FALSE

TRUE

50 / 50

In Flex specification file different sections are separated by ________ .

Your score is

The average score is 0%