CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

Follow of B is ____ .

g, h, i, $

g, i

2 / 50

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

TRUE

FALSE

3 / 50

Parser takes tokens from scanner and tries to generate ______ .

Parse tree

None of the given

Syntax tree

Binary Search tree

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

5 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

6 / 50

Compilers are sometimes classified as.

Multi pass

Single pass

Load and go

All of the given

7 / 50

LR parsing _____ a string to the start symbol by inverting productions.

Adds

Reduces

None of the given

Shifts

8 / 50

Left factoring is enough to make a grammar LL(1).

TRUE

FALSE

9 / 50

Responsibility of _____ is to produce fast and compact code.

None of given

Instruction scheduling

Instruction selection

10 / 50

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

Forward

Decent

Backward

Ascent

11 / 50

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

Back End

Middle End

Front End

Both Front end and Back end

12 / 50

_______ algorithm is used in DFA minimization.

Robert‟s

Hopcroft’s

James‟s

None of given

13 / 50

A lexical analyzer generator automatically constructs a _____ that recognizes tokens.

PDA

None of the given

14 / 50

Lexer and scanner are two different phases of compiler

TRUE

FALSE

15 / 50

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

Hard disk

Memory

Registers

Secondary storage

16 / 50

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

FALSE

TRUE

17 / 50

______ phase which supports macro substitution and conditional compilation.

Preprocessing

Semantic

None

Syntax

18 / 50

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

Same

Different

Onto

19 / 50

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

FALSE

TRUE

20 / 50

A _______ is a top down parser.

Reactive parser

Predictive Parsing

Proactive parser

None of the given

21 / 50

Consider the grammar

h, g, $

h, i, $

g, h, i, $

g, h, $

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

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

Terminal

Non-terminal

24 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

Jlex

Complex

None of given

25 / 50

In DFA minimization we construct one ______ for each group of states from the initial DFA.

State

None of given

NFA

PDA

26 / 50

___________ phase which supports macro substitution and conditional compilation.

Syntax

None

Preprocessing

Semantic

27 / 50

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

TRUE

FALSE

28 / 50

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

None of the given

Previous state

Reject state

Next state

29 / 50

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

None of the given

Applying left factoring

Removing left recurrence and Applying left factoring

Removing left recurrence

30 / 50

An important component of semantic analysis is _________ .

flush checking

type checking

code checking

None of the given

31 / 50

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

FALSE

TRUE

32 / 50

____________avoid hardware stalls and interlocks.

Instruction scheduling

Instruction selection

None of given

33 / 50

In PASCAL ___________ represent the inequality test.

34 / 50

Lexical Analyzer generator _______ is written in Java.

Flex

Jlex

None of given

Complex

35 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

36 / 50

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

TRUE

FALSE

37 / 50

Lexical Analyzer generator _______ is written in Java.

Jlex

Complex

Flex

None of given

38 / 50

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

None of the given

All of the given

Left-to-right scan of input

left-most derivation

39 / 50

Parser takes tokens from scanner and tries to generate______ .

Binary Search tree

Syntax trace

Parse tree

None of the given

40 / 50

45.Follow of C is ____ .

g, h, $

h, g, $

g, h, i, $

h, i, $

41 / 50

LR parsers can handle _______ grammars.

Left-recursive

Start-recursive

file-recursive

End-recursive

42 / 50

Functions of Lexical analyzer are?

Removing constants, identifiers and keywords

All of the given

Removing comments

Removing white space

43 / 50

First of C is ______ .

g, h, I, $

g, I

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

45 / 50

____is evaluated to yield a value.

Declaration and Command

Declaration

Command

Expression

46 / 50

Grammars with LL(1) conflicts can be made LL(1) by applying left-factoring, substitution, and left-recursion removal. Left-factoring takes care of ________conflicts.

FIRST/SECOND

SECOND/FIRST

None of the given

FIRST/FIRST

47 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction selection

Instruction scheduling

None of given

48 / 50

Which of the statement is true about Regular Languages?

Regular Languages are the most popular for specifying tokens.

Regular Languages are easy to understand.

Regular Languages are based on simple and useful theory.

All of the given

49 / 50

_______ algorithm is used in DFA minimization.

Robert’s

James’s

Hopcroft’s

None of given

50 / 50

Functions of Lexical analyzer are?

Removing white space

Removing constants, identifiers and keywords

Removing comments

All of the given

Your score is

The average score is 0%