CS606 Midterm Online Quiz

Lexer and scanner are two different phases of compiler

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

LR parsers can handle _______ grammars.

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 multi pass compiler during the first pass it gathers information about __________ .

Responsibility of _____ is to produce fast and compact code.

In PASCAL ___________ represent the inequality test.

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

____________avoid hardware stalls and interlocks.

Lexical Analyzer generator _______ is written in Java.

Which of the statement is true about Regular Languages?

The non-terminal _______ is left recursive.

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

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

Which of the statement is true about Regular Languages?

Left factoring is enough to make LL1 grammar

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

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

Functions of Lexical analyzer are?

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

___________ phase which supports macro substitution and conditional compilation.

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

Optimal registers allocation is an NP-hard problem.

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

Front end of two pass compiler takes________ as input.

Consider the grammar

Functions of Lexical analyzer are?

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

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

Left factoring is enough to make a grammar LL(1).

Compilers are sometimes classified as.

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

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

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

First of C is ______ .

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

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

______ phase which supports macro substitution and conditional compilation.

Parser always gives a tree like structure as output

Lexical Analyzer generator _______ is written in Java.

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

Follow of B is ____ .

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

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

Compilers are sometimes classified as.

In predictive parsing table the rows are ___________ .

An important component of semantic analysis is _________ .

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