CS606 Midterm Online Quiz

Bottom-up parsers handle a ________ class of grammars.

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

____________avoid hardware stalls and interlocks.

___________ phase which supports macro substitution and conditional compilation.

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

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

Functions of Lexical analyzer are?

Which of the statement is true about Regular Languages?

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

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

In Flex specification file different sections are separated by ________ .

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

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

45.Follow of C is ____ .

A _______ is a top down parser.

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

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

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

Lexical Analyzer generator _______ is written in Java.

The non-terminal _______ is left recursive.

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.

Parser takes tokens from scanner and tries to generate ______ .

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

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

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.

Lexical Analyzer generator _______ is written in Java.

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

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

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

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

In PASCAL ___________ represent the inequality test.

Left factoring is enough to make LL1 grammar

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

Compilers are sometimes classified as.

____is evaluated to yield a value.

Which of the statement is true about Regular Languages?

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

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

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.

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

NFA is easy to implement as compared to DFA.

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

Front end of two pass compiler takes________ as input.

Parser takes tokens from scanner and tries to generate ______ .

Compilers are sometimes classified as.

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

Consider the grammar

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