CS606 Midterm Online Quiz

Lexical Analyzer generator _______ is written in Java.

Lexical Analyzer generator _______ is written in Java.

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.

An important component of semantic analysis is _________ .

Front end of two pass compiler takes________ as input.

Parser always gives a tree like structure as output

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

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

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

Lexical Analyzer generator _______ is written in Java.

Front end of two pass compiler takes________ as input.

______ phase which supports macro substitution and conditional compilation.

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.

Functions of Lexical analyzer are?

In predictive parsing table the rows are ___________ .

Follow of B is ____ .

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

Consider the grammar

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

An important component of semantic analysis is _________ .

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

Functions of Lexical analyzer are?

LR parsers can handle _______ grammars.

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.

Which of the statement is true about Regular Languages?

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

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

Parser always gives a tree like structure as output

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

_______ algorithm is used in DFA minimization.

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.

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

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

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

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

In PASCAL ___________ represent the inequality test.

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

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

A _______ is a top down parser.

Parser takes tokens from scanner and tries to generate ______ .

In predictive parsing table the rows are ___________ .

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

_______ algorithm is used in DFA minimization.

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

In compilation process Hierarchical analysis is also called

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

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

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

Consider the grammar