CS606 Midterm Online Quiz

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 multi pass compiler during the first pass it gathers information about __________ .

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

Consider the grammar

____________avoid hardware stalls and interlocks.

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

____________avoid hardware stalls and interlocks.

Lexical Analyzer generator _______ is written in Java.

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

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

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

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

In predictive parsing table the rows are ___________ .

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

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

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

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

In compilation process Hierarchical analysis is also called

Consider the grammar

___________ phase which supports macro substitution and conditional compilation.

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

Parser always gives a tree like structure as output

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

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

Parser takes tokens from scanner and tries to generate ______ .

Lexical Analyzer generator _______ is written in Java.

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

_______ algorithm is used in DFA minimization.

Front end of two pass compiler takes________ as input.

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

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

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

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

45.Follow of C is ____ .

Left factoring is enough to make LL1 grammar

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

NFA is easy to implement as compared to DFA.

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

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.

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

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

The regular expressions a*|b* and (a|b)* describe the _____set of strings.

______ phase which supports macro substitution and conditional compilation.

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

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

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

Lexer and scanner are two different phases of compiler

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

Lexer and scanner are two different phases of compiler

NFA is easy to implement as compared to DFA.