CS606 Midterm Online Quiz

Consider the grammar

Bottom-up parsers handle a ________ class of grammars.

In compilation process Hierarchical analysis is also called

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

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

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

Parser always gives a tree like structure as output

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

In predictive parsing table the rows are ___________ .

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

Compilers are sometimes classified as.

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

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

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

____________avoid hardware stalls and interlocks.

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

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

In Flex specification file different sections are separated by ________ .

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

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.

Parser takes tokens from scanner and tries to generate ______ .

_______ algorithm is used in DFA minimization.

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.

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

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

45.Follow of C is ____ .

Parser takes tokens from scanner and tries to generate______ .

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

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

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

Front end of two pass compiler takes________ as input.

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

Left factoring is enough to make LL1 grammar

Left factoring is enough to make LL1 grammar

AST summarizes the grammatical structure with the details of derivations.

Optimal registers allocation is an NP-hard problem.

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

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

NFA is easy to implement as compared to DFA.

LR parsers can handle _______ grammars.

In predictive parsing table the rows are ___________ .

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

First of C is ______ .

Responsibility of _____ is to produce fast and compact code.

A _______ is a top down parser.

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

Which of the statement is true about Regular Languages?

______ phase which supports macro substitution and conditional compilation.

Parser always gives a tree like structure as output

LR parsers can handle _______ grammars.