CS606 Midterm Online Quiz

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

Parser takes tokens from scanner and tries to generate ______ .

Parser always gives a tree like structure as output

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.

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

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

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

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

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

___________ phase which supports macro substitution and conditional compilation.

Follow of B is ____ .

In compilation process Hierarchical analysis is also called

An important component of semantic analysis is _________ .

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.

______ phase which supports macro substitution and conditional compilation.

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

Functions of Lexical analyzer are?

LR parsers can handle _______ grammars.

Lexer and scanner are two different phases of compiler

The non-terminal _______ is left recursive.

____is evaluated to yield a value.

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

LR parsers can handle _______ grammars.

LR parsing _____ a string to the start symbol by inverting productions.

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

_______ algorithm is used in DFA minimization.

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

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.

Front end of two pass compiler takes________ as input.

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

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

NFA is easy to implement as compared to DFA.

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

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

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

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

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

Lexer and scanner are two different phases of compiler

Consider the grammar

Lexical Analyzer generator _______ is written in Java.

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

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

____________avoid hardware stalls and interlocks.

Front end of two pass compiler takes________ as input.

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

An important component of semantic analysis is _________ .

Functions of Lexical analyzer are?

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

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