CS606 Midterm Online Quiz

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

_______ algorithm is used in DFA minimization.

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

LR parsers can handle _______ grammars.

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

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

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

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

A _______ is a top down parser.

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

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.

Parser always gives a tree like structure as output

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

Left factoring is enough to make LL1 grammar

A grammar is LR if a ------ shift reduce-reduce parser can recognize handles when they appear on the top of stack.

Consider the grammar

First of C is ______ .

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

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

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

45.Follow of C is ____ .

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

Front end of two pass compiler takes________ as input.

Functions of Lexical analyzer are?

Parser takes tokens from scanner and tries to generate______ .

Can a DFA simulate NFA?

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

NFA is easy to implement as compared to DFA.

______ phase which supports macro substitution and conditional compilation.

The non-terminal _______ is left recursive.

___________ phase which supports macro substitution and conditional compilation.

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

In Flex specification file different sections are separated by ________ .

____________avoid hardware stalls and interlocks.

Left factoring is enough to make LL1 grammar

Optimal registers allocation is an NP-hard problem.

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

Lexical Analyzer generator _______ is written in Java.

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

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

Lexical Analyzer generator _______ is written in Java.

In PASCAL ___________ represent the inequality test.

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 Three-pass compiler ____ is used for code improvement or optimization.

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

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

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

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

In predictive parsing table the rows are ___________ .