CS606 Midterm Online Quiz

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.

LR parsers can handle _______ grammars.

_______ algorithm is used in DFA minimization.

Which of the statement is true about Regular Languages?

Can a DFA simulate NFA?

Front end of two pass compiler takes________ as input.

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

Lexical Analyzer generator _______ is written in Java.

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

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

Lexer and scanner are two different phases of compiler

45.Follow of C is ____ .

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

LR parsers can handle _______ grammars.

Consider the grammar

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

____is evaluated to yield a value.

In predictive parsing table the rows are ___________ .

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

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

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

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

_______ algorithm is used in DFA minimization.

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.

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

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

Consider the grammar

Lexical Analyzer generator _______ is written in Java.

Responsibility of _____ is to produce fast and compact code.

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

NFA is easy to implement as compared to DFA.

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

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

Left factoring is enough to make LL1 grammar

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

Parser takes tokens from scanner and tries to generate ______ .

Consider the following grammar,

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

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

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

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.

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.

In PASCAL ___________ represent the inequality test.

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

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

Parser always gives a tree like structure as output

Yacc contains built-in support for handling ambiguous grammars resulting in shift-reduce conflicts. By default these conflicts are solved by performing the ________.

____________avoid hardware stalls and interlocks.

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