CS606 Midterm Online Quiz

AST summarizes the grammatical structure with the details of derivations.

Responsibility of _____ is to produce fast and compact code.

Lexical Analyzer generator _______ is written in Java.

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

___________ phase which supports macro substitution and conditional compilation.

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

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

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

Parser always gives a tree like structure as output

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

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

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

Left factoring is enough to make LL1 grammar

In predictive parsing table the rows are ___________ .

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

A _______ is a top down parser.

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

In predictive parsing table the rows are ___________ .

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

____________avoid hardware stalls and interlocks.

Can a DFA simulate NFA?

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

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

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

Consider the grammar

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

Front end of two pass compiler takes________ as input.

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

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.

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.

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

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.

_______ algorithm is used in DFA minimization.

LR parsers can handle _______ grammars.

NFA is easy to implement as compared to DFA.

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

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

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

Lexer and scanner are two different phases of compiler

Lexer and scanner are two different phases of compiler

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

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

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

Which of the statement is true about Regular Languages?

In Flex specification file different sections are separated by ________ .

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

Consider the following grammar,

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

NFA is easy to implement as compared to DFA.