CS606 Midterm Online Quiz

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

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

Which of the statement is true about Regular Languages?

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

An important component of semantic analysis is _________ .

Front end of two pass compiler takes________ as input.

Lexical Analyzer generator _______ is written in Java.

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

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

In Flex specification file different sections are separated by ________ .

Left factoring is enough to make LL1 grammar

LR parsers can handle _______ grammars.

Reduction of a handle to the ------- on the left hand side of the grammar rule is a step along the reverse of a right most derivation.

Parser takes tokens from scanner and tries to generate ______ .

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

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

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.

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

_______ algorithm is used in DFA minimization.

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

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

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 DFA minimization we construct one ______ for each group of states from the initial DFA.

Compilers are sometimes classified as.

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

_______ algorithm is used in DFA minimization.

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.

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

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

In predictive parsing table the rows are ___________ .

Front end of two pass compiler takes________ as input.

Which of the statement is true about Regular Languages?

______ phase which supports macro substitution and conditional compilation.

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

Front end of two pass compiler takes________ as input.

Lexical Analyzer generator _______ is written in Java.

Left factoring is enough to make LL1 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.

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

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

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 LL1() parsing algorithm _________ contains a sequence of grammar symbols.

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

Lexical Analyzer generator _______ is written in Java.

Parser always gives a tree like structure as output

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

Responsibility of _____ is to produce fast and compact code.

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

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