CS606 Midterm Online Quiz

In predictive parsing table the rows are ___________ .

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

Parser takes tokens from scanner and tries to generate______ .

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

Lexer and scanner are two different phases of compiler

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

Front end of two pass compiler takes________ as input.

In predictive parsing table the rows are ___________ .

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

Responsibility of _____ is to produce fast and compact code.

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

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

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

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

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

NFA is easy to implement as compared to DFA.

Parser takes tokens from scanner and tries to generate ______ .

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

Bottom-up parsers handle a ________ class of grammars.

______ phase which supports macro substitution and conditional compilation.

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.

An important component of semantic analysis is _________ .

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

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.

NFA is easy to implement as compared to DFA.

Responsibility of _____ is to produce fast and compact code.

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

AST summarizes the grammatical structure with the details of derivations.

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

First of C is ______ .

____________avoid hardware stalls and interlocks.

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

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

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

Compilers are sometimes classified as.

Lexical Analyzer generator _______ is written in Java.

Front end of two pass compiler takes________ as input.

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

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

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

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

LR parsers can handle _______ grammars.

_______ algorithm is used in DFA minimization.

Front end of two pass compiler takes________ as input.

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

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

___________ phase which supports macro substitution and conditional compilation.