CS606 Midterm Online Quiz

CS606-Midterm

1 / 50

Consider the grammar

g, h, i, $

g, i

2 / 50

____is evaluated to yield a value.

Expression

Declaration

Command

Declaration and Command

3 / 50

Functions of Lexical analyzer are?

Removing comments

Removing white space

Removing constants, identifiers and keywords

All of the given

4 / 50

In predictive parsing table the rows are ___________ .

Non-terminals

Both non-terminal and terminals

Terminals

None of the given

5 / 50

Lexical Analyzer generator _______ is written in Java.

Complex

Jlex

None of given

Flex

6 / 50

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

TRUE

FALSE

7 / 50

In predictive parsing table the rows are ___________ .

Terminals

Non-terminals

None of the given

Both non-terminal and terminals

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

9 / 50

Lexical Analyzer generator _______ is written in Java.

None of given

Flex

Jlex

Complex

10 / 50

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

Decent

Forward

Backward

Ascent

11 / 50

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

State

PDA

None of given

NFA

12 / 50

Follow of B is ____ .

g, h, i, $

g, i

13 / 50

NFA is easy to implement as compared to DFA.

FALSE

TRUE

14 / 50

Responsibility of _____ is to produce fast and compact code.

Instruction scheduling

None of given

Instruction selection

15 / 50

A _______ is a top down parser.

None of the given

Proactive parser

Reactive parser

Predictive Parsing

16 / 50

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

Start

Front end

Back end

None of given

17 / 50

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

Previous state

Reject state

Next state

None of the given

18 / 50

An important component of semantic analysis is _________ .

flush checking

type checking

None of the given

code checking

19 / 50

In PASCAL ___________ represent the inequality test.

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

{0,1,2}

{0,1}

21 / 50

Can a DFA simulate NFA?

Sometimes

Yes

22 / 50

Front end of two pass compiler takes________ as input.

Intermediate representation

Machine code

None

Source code

23 / 50

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

Back end

None of given

Start

Front end

24 / 50

Compilers are sometimes classified as.

Single pass

All of the given

Multi pass

Load and go

25 / 50

LR parsers can handle _______ grammars.

Left-recursive

End-recursive

file-recursive

Start-recursive

26 / 50

Compilers are sometimes classified as.

Single pass

Multi pass

All of the given

Load and go

27 / 50

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

FALSE

TRUE

28 / 50

The following two items A -> P • Q B -> P • Q can co-exist in an ______ item set.

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

30 / 50

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

Preprocessor

Compiler

Assembler

Loader/link-editor

31 / 50

Parser always gives a tree like structure as output

TRUE

FALSE

32 / 50

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

FALSE

TRUE

33 / 50

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

TRUE

FALSE

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

35 / 50

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

FALSE

TRUE

36 / 50

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

None of the given

Removing left recurrence

Removing left recurrence and Applying left factoring

Applying left factoring

37 / 50

NFA is easy to implement as compared to DFA.

FALSE

TRUE

38 / 50

Parser takes tokens from scanner and tries to generate ______ .

Syntax trace

Parse tree

Binary Search tree

None of the given

39 / 50

Optimal registers allocation is an NP-hard problem.

FALSE

TRUE

40 / 50

Which of the statement is true about Regular Languages?

All of the given

Regular Languages are the most popular for specifying tokens.

Regular Languages are based on simple and useful theory.

Regular Languages are easy to understand.

41 / 50

Alternative of the backtrack in parser is Look ahead symbol in ______ .

none

output

input

input and output

42 / 50

Yacc contains built-in support for handling ambiguous grammars resulting in _______

Shift-second

Shift-reduce

Shift-Shift

conflicts.

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

44 / 50

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

Front End

Back End

Middle End

Both Front end and Back end

45 / 50

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

FALSE

TRUE

46 / 50

Consider the following grammar,

h, g, i

None of the given

47 / 50

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

Ascent

Decent

Forward

Backward

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

49 / 50

In Flex specification file different sections are separated by ________ .

50 / 50

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

Stack

None

Array

Link list

Your score is

The average score is 0%