CS606 Midterm Online Quiz

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

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

LR parsers can handle _______ grammars.

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

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

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

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

Lexical Analyzer generator _______ is written in Java.

_______ algorithm is used in DFA minimization.

Parser takes tokens from scanner and tries to generate ______ .

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

First of C is ______ .

An important component of semantic analysis is _________ .

Front end of two pass compiler takes________ as input.

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

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

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 ________.

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.

Functions of Lexical analyzer are?

Compilers are sometimes classified as.

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

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

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

A _______ is a top down parser.

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

In predictive parsing table the rows are ___________ .

Parser takes tokens from scanner and tries to generate ______ .

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

Left factoring is enough to make LL1 grammar

Compilers are sometimes classified as.

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

___________ phase which supports macro substitution and conditional compilation.

____________avoid hardware stalls and interlocks.

AST summarizes the grammatical structure with the details of derivations.

Lexer and scanner are two different phases of compiler

In Flex specification file different sections are separated by ________ .

Responsibility of _____ is to produce fast and compact code.

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

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

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.

In PASCAL ___________ represent the inequality test.

LR parsers can handle _______ grammars.

Follow of B is ____ .

Responsibility of _____ is to produce fast and compact code.

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

Left factoring is enough to make LL1 grammar

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

_______ 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.