CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

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

NFA

PDA

State

None of given

2 / 50

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

Hard disk

Secondary storage

Registers

Memory

3 / 50

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

left-most derivation

None of the given

All of the given

Left-to-right scan of input

4 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction scheduling

Instruction selection

None of given

5 / 50

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

Applying left factoring

Removing left recurrence

Removing left recurrence and Applying left factoring

None of the given

6 / 50

45.Follow of C is ____ .

g, h, $

h, i, $

g, h, i, $

h, g, $

7 / 50

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

Link list

Stack

None

Array

8 / 50

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

Next state

None of the given

Reject state

Previous state

9 / 50

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

TRUE

FALSE

10 / 50

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

TRUE

FALSE

11 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

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

All of the given

Regular Languages are the most popular for specifying tokens.

13 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

14 / 50

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

Ascent

Forward

Decent

Backward

15 / 50

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

PDA

NFA

State

None of given

16 / 50

Parser takes tokens from scanner and tries to generate ______ .

Syntax trace

Parse tree

Binary Search tree

None of the given

17 / 50

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

Memory

Secondary storage

Registers

Hard disk

18 / 50

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

FALSE

TRUE

19 / 50

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

None of the given

Reject state

Previous state

Next state

20 / 50

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

FALSE

TRUE

21 / 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/FIRST

None of the given

SECOND/FIRST

FIRST/SECOND

22 / 50

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

{0,1,2}

{0}

{0,1}

{0,1,2,3}

23 / 50

Lexer and scanner are two different phases of compiler

FALSE

TRUE

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

25 / 50

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

Ascent

Decent

Forward

26 / 50

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

FALSE

TRUE

27 / 50

An ----- does not need to examine the entire stack for a handle, the state symbol on the top of the stack contains all the information it needs

None of the given

BU parser

LR parser

RL parser

28 / 50

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

{0,1,2,3}

{0,1}

{0}

{0,1,2}

29 / 50

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

TRUE

FALSE

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

31 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

32 / 50

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

Compiler

Loader/link-editor

Preprocessor

Assembler

33 / 50

Consider the grammar

h, i, $

g, h, i, $

g, h, $

h, g, $

34 / 50

Optimal registers allocation is an NP-hard problem.

TRUE

FALSE

35 / 50

First of C is ______ .

g, I

g, h, I, $

36 / 50

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

Syntax analysis

None of given

Both Parsing and Syntax analysis

Parsing

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

38 / 50

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

None of the given

PDA

39 / 50

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

Applying left factoring

Removing left recurrence and Applying left factoring

Removing left recurrence

None of the given

40 / 50

Lexical Analyzer generator _______ is written in Java.

None of given

Complex

Flex

Jlex

41 / 50

Responsibility of _____ is to produce fast and compact code.

None of given

Instruction selection

Instruction scheduling

42 / 50

In predictive parsing table the rows are ___________ .

Non-terminals

Both non-terminal and terminals

None of the given

Terminals

43 / 50

_______ algorithm is used in DFA minimization.

James‟s

None of given

Hopcroft’s

Robert‟s

44 / 50

Front end of two pass compiler takes________ as input.

Machine Code

Intermediate Representation (IR)

None of the Given

Source code

45 / 50

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

FALSE

TRUE

46 / 50

Front end of two pass compiler takes________ as input.

None

Source code

Machine code

Intermediate representation

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

Reduce action

Shift and reduce actions

Shift action

48 / 50

LR parsers can handle _______ grammars.

file-recursive

Start-recursive

End-recursive

Left-recursive

49 / 50

LR parsers can handle _______ grammars.

End-recursive

Left-recursive

Start-recursive

file-recursive

50 / 50

Optimal registers allocation is an NP-hard problem.

TRUE

FALSE

Your score is

The average score is 0%