CS606 Midterm Online Quiz

NFA is easy to implement as compared to DFA.

____________avoid hardware stalls and interlocks.

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

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

Functions of Lexical analyzer are?

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

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

____________avoid hardware stalls and interlocks.

Parser takes tokens from scanner and tries to generate ______ .

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

NFA is easy to implement as compared to DFA.

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

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

Follow of B is ____ .

In predictive parsing table the rows are ___________ .

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

Front end of two pass compiler takes________ as input.

Lexical Analyzer generator _______ is written in Java.

Parser takes tokens from scanner and tries to generate______ .

Front end of two pass compiler takes________ as input.

Lexical Analyzer generator _______ is written in Java.

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

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

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

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

Optimal registers allocation is an NP-hard problem.

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

Left factoring is enough to make LL1 grammar

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

______ phase which supports macro substitution and conditional compilation.

Typical compilation means programs written in high-level languages to low-level ____________.

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.

The non-terminal _______ is left recursive.

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

____is evaluated to yield a value.

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

Consider the following grammar,

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

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

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

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

Can a DFA simulate NFA?

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

_______ algorithm is used in DFA minimization.

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

Compilers are sometimes classified as.

Responsibility of _____ is to produce fast and compact code.