CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

LR parsers can handle _______ grammars.

Left-recursive

file-recursive

Start-recursive

End-recursive

2 / 50

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

All of the given

Left-to-right scan of input

None of the given

left-most derivation

3 / 50

Front end of two pass compiler takes________ as input.

None

Source code

Machine code

Intermediate representation

4 / 50

A _______ is a top down parser.

Reactive parser

None of the given

Proactive parser

Predictive Parsing

5 / 50

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

FALSE

TRUE

6 / 50

_______ algorithm is used in DFA minimization.

Robert’s

None of given

James’s

Hopcroft’s

7 / 50

______ phase which supports macro substitution and conditional compilation.

Preprocessing

Semantic

None

Syntax

8 / 50

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

FALSE

TRUE

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

10 / 50

Lexical Analyzer generator _______ is written in Java.

Complex

None of given

Flex

Jlex

11 / 50

In predictive parsing table the rows are ___________ .

Terminals

Non-terminals

None of the given

Both non-terminal and terminals

12 / 50

Functions of Lexical analyzer are?

All of the given

Removing comments

Removing constants, identifiers and keywords

Removing white space

13 / 50

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

None of the given

left-to-rise

left-to-right

left-to-reverse

14 / 50

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

None of the given

Previous state

Next state

Reject state

15 / 50

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

PDA

None of the given

16 / 50

Parser takes tokens from scanner and tries to generate______ .

None of the given

Syntax trace

Parse tree

Binary Search tree

17 / 50

First of C is ______ .

g, I

g, h, I, $

18 / 50

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

TRUE

FALSE

19 / 50

Parser takes tokens from scanner and tries to generate ______ .

Binary Search tree

Syntax tree

Parse tree

None of the given

20 / 50

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

TRUE

FALSE

21 / 50

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

FALSE

TRUE

22 / 50

Consider the grammar

g, h, i, $

g, i

23 / 50

In compilation process Hierarchical analysis is also called

Parsing

Syntax analysis

Both Parsing and Syntax analysis

None of given

24 / 50

Optimal registers allocation is an NP-hard problem.

FALSE

TRUE

25 / 50

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

Compiler

Assembler

Preprocessor

Loader/link-editor

26 / 50

Consider the grammar

g, h, i, $

h, i, $

h, g, $

g, h, $

27 / 50

Compilers are sometimes classified as.

All of the given

Multi pass

Load and go

Single pass

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

29 / 50

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

Hard disk

Secondary storage

Memory

Registers

30 / 50

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

None of the given

O(log n)

O(n log n)

N P-Complete

31 / 50

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

Loader/link-editor

Compiler

Preprocessor

Assembler

32 / 50

____________avoid hardware stalls and interlocks.

None of given

Instruction scheduling

Instruction selection

33 / 50

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

TRUE

FALSE

34 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

35 / 50

Lexical Analyzer generator _______ is written in Java.

Complex

Jlex

Flex

None of given

36 / 50

Which of the statement is true about Regular Languages?

Regular Languages are easy to understand.

Regular Languages are the most popular for specifying tokens.

All of the given

Regular Languages are based on simple and useful theory.

37 / 50

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

TRUE

FALSE

38 / 50

LR parsers can handle _______ grammars.

file-recursive

Left-recursive

Start-recursive

End-recursive

39 / 50

In Flex specification file different sections are separated by ________ .

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

41 / 50

____________avoid hardware stalls and interlocks.

None of given

Instruction selection

Instruction scheduling

42 / 50

Lexical Analyzer generator _______ is written in Java.

Complex

None of the given

Jlex

Flex

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

{0,1,2,3}

{0}

44 / 50

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

Previous state

Reject state

Next state

None of the given

45 / 50

Responsibility of _____ is to produce fast and compact code.

None of given

Instruction scheduling

Instruction selection

46 / 50

_______ algorithm is used in DFA minimization.

Robert‟s

None of given

James‟s

Hopcroft’s

47 / 50

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

FALSE

TRUE

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.

All of the given

Regular Languages are based on simple and useful theory.

49 / 50

LR parsers can handle _______ grammars.

Left-recursive

Start-recursive

End-recursive

file-recursive

50 / 50

Front end of two pass compiler takes________ as input.

Machine Code

Intermediate Representation (IR)

Source code

None of the Given

Your score is

The average score is 0%