CS606 Midterm Online Quiz

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

Parser takes tokens from scanner and tries to generate ______ .

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

Lexical Analyzer generator _______ is written in Java.

Consider the grammar

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

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

AST summarizes the grammatical structure with the details of derivations.

Functions of Lexical analyzer are?

Can a DFA simulate NFA?

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

_______ algorithm is used in DFA minimization.

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

Functions of Lexical analyzer are?

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

Responsibility of _____ is to produce fast and compact code.

Follow of B is ____ .

LR parsers can handle _______ grammars.

NFA is easy to implement as compared to DFA.

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.

Parser always gives a tree like structure as output

LR parsers can handle _______ grammars.

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

When generating a lexical analyzer from a ________ description, the item sets (states) are constructed by two types of “moves”: character moves and e moves.

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

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

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

Left factoring is enough to make LL1 grammar

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

____________avoid hardware stalls and interlocks.

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

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.

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

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.

Compilers are sometimes classified as.

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

An important component of semantic analysis is _________ .

Compilers are sometimes classified as.

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

Consider the following grammar,

Which of the statement is true about Regular Languages?

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

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

NFA is easy to implement as compared to DFA.

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

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

Lexical Analyzer generator _______ is written in Java.

Parser takes tokens from scanner and tries to generate ______ .

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

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