CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

Front end of two pass compiler takes________ as input.

None of the Given

Machine Code

Source code

Intermediate Representation (IR)

2 / 50

A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.

left-to-rise

None of the given

left-to-right

left-to-reverse

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

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

FALSE

TRUE

5 / 50

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

Bindings

None

Static information

Declarations

6 / 50

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

Shift and reduce actions

Reduce action

Shift action

De-allocation of memory

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

None of the given

SECOND/FIRST

FIRST/FIRST

FIRST/SECOND

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

9 / 50

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

PDA

None of given

State

NFA

10 / 50

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

FALSE

TRUE

11 / 50

An important component of semantic analysis is _________ .

None of the given

code checking

flush checking

type checking

12 / 50

____________avoid hardware stalls and interlocks.

None of given

Instruction selection

Instruction scheduling

13 / 50

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

Backend

Frontend

Start

14 / 50

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

Different

Same

Onto

15 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

16 / 50

NFA is easy to implement as compared to DFA.

TRUE

FALSE

17 / 50

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

FALSE

TRUE

18 / 50

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

FALSE

TRUE

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

RL parser

None of the given

BU parser

LR parser

20 / 50

Parser always gives a tree like structure as output

FALSE

TRUE

21 / 50

Consider the grammar

g, h, i, $

g, i

22 / 50

_______ algorithm is used in DFA minimization.

James’s

Robert’s

None of given

Hopcroft’s

23 / 50

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

Adds

Reduces

Shifts

None of the given

24 / 50

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

Back end

Front end

None of given

Start

25 / 50

A _______ is a top down parser.

Proactive parser

Reactive parser

Predictive Parsing

None of the given

26 / 50

___________ phase which supports macro substitution and conditional compilation.

Preprocessing

Semantic

Syntax

None

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

None of the given

Epsilon

28 / 50

Front end of two pass compiler takes________ as input.

None of the Given

Machine Code

Intermediate Representation (IR)

Source code

29 / 50

45.Follow of C is ____ .

g, h, i, $

h, g, $

g, h, $

h, i, $

30 / 50

______ phase which supports macro substitution and conditional compilation.

Semantic

Syntax

Preprocessing

None

31 / 50

Left factoring is enough to make LL1 grammar

TRUE

FALSE

32 / 50

AST summarizes the grammatical structure with the details of derivations.

TRUE

FALSE

33 / 50

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

Ascent

Forward

Decent

34 / 50

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

FALSE

TRUE

35 / 50

In compilation process Hierarchical analysis is also called

Both Parsing and Syntax analysis

Parsing

None of given

Syntax analysis

36 / 50

Lexer and scanner are two different phases of compiler

FALSE

TRUE

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

38 / 50

In Flex specification file different sections are separated by ________ .

39 / 50

In predictive parsing table the rows are ___________ .

Both non-terminal and terminals

Terminals

None of the given

Non-terminals

40 / 50

Consider the following grammar,

h, g, i

None of the given

41 / 50

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

Ascent

Backward

Decent

Forward

42 / 50

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

Secondary storage

Registers

Memory

Hard disk

43 / 50

Consider the grammar

h, g, $

h, i, $

g, h, i, $

g, h, $

44 / 50

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

{0,1,2}

{0,1,2,3}

{0}

{0,1}

45 / 50

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

PDA

None of the given

46 / 50

Compilers are sometimes classified as.

Single pass

All of the given

Multi pass

Load and go

47 / 50

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

Memory

Hard disk

Registers

Secondary storage

48 / 50

LR parsers can handle _______ grammars.

file-recursive

Start-recursive

Left-recursive

End-recursive

49 / 50

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

Preprocessor

Loader/link-editor

Assembler

Compiler

50 / 50

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

TRUE

FALSE

Your score is

The average score is 0%