CS606 Midterm Online Quiz

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

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

45.Follow of C is ____ .

___________ phase which supports macro substitution and conditional compilation.

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

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

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

_____ 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______ .

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

In Flex specification file different sections are separated by ________ .

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

NFA is easy to implement as compared to DFA.

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.

NFA is easy to implement as compared to DFA.

AST summarizes the grammatical structure with the details of derivations.

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

Left factoring is enough to make LL1 grammar

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.

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

_______ algorithm is used in DFA minimization.

In predictive parsing table the rows are ___________ .

Functions of Lexical analyzer are?

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

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

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

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

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

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

In predictive parsing table the rows are ___________ .

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

____________avoid hardware stalls and interlocks.

An important component of semantic analysis is _________ .

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

Functions of Lexical analyzer are?

____is evaluated to yield a value.

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 PASCAL ___________ represent the inequality test.

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

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

Left factoring is enough to make LL1 grammar

Responsibility of _____ is to produce fast and compact code.

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

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

Consider the grammar

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

Which of the statement is true about Regular Languages?

A _______ is a top down parser.

Lexical Analyzer generator _______ is written in Java.