CS606 Midterm Online Quiz

In compilation process Hierarchical analysis is also called

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

In PASCAL ___________ represent the inequality test.

Lexer and scanner are two different phases of compiler

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

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

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

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

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

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

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.

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

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

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

Lexical Analyzer generator _______ is written in Java.

Parser always gives a tree like structure as output

45.Follow of C is ____ .

____________avoid hardware stalls and interlocks.

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

Can a DFA simulate NFA?

In predictive parsing table the rows are ___________ .

Compilers are sometimes classified as.

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.

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

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

______ phase which supports macro substitution and conditional compilation.

Lexical Analyzer generator _______ is written in Java.

Lexical Analyzer generator _______ is written in Java.

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

___________ phase which supports macro substitution and conditional compilation.

Front end of two pass compiler takes________ as input.

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

Follow of B is ____ .

In Three-pass compiler ____ is used for code improvement or optimization.

In Three-pass compiler ____ is used for code improvement or optimization.

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

Front end of two pass compiler takes________ as input.

Bottom-up parsers handle a ________ class of grammars.

Functions of Lexical analyzer are?

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

Parser always gives a tree like structure as output

Lexer and scanner are two different phases of compiler

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

Left factoring is enough to make LL1 grammar

In predictive parsing table the rows are ___________ .

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

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

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