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.

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

Can a DFA simulate NFA?

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

Lexical Analyzer generator _______ is written in Java.

_______ algorithm is used in DFA minimization.

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

___________ phase which supports macro substitution and conditional compilation.

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

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.

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

In Flex specification file different sections are separated by ________ .

Optimal registers allocation is an NP-hard problem.

Consider the grammar

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

AST summarizes the grammatical structure with the details of derivations.

An important component of semantic analysis is _________ .

NFA is easy to implement as compared to DFA.

Follow of B is ____ .

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

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

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

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

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

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

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

45.Follow of C is ____ .

Which of the statement is true about Regular Languages?

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

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

Parser takes tokens from scanner and tries to generate ______ .

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

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

Responsibility of _____ is to produce fast and compact code.

Compilers are sometimes classified as.

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

Bottom-up parsers handle a ________ class of grammars.

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

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.

In predictive parsing table the rows are ___________ .

______ phase which supports macro substitution and conditional compilation.

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

Functions of Lexical analyzer are?

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

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

The non-terminal _______ is left recursive.

Functions of Lexical analyzer are?

Responsibility of _____ is to produce fast and compact code.

An important component of semantic analysis is _________ .