CS606 Midterm Online Quiz

Parser takes tokens from scanner and tries to generate ______ .

____________avoid hardware stalls and interlocks.

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

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

Parser takes tokens from scanner and tries to generate______ .

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

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

Parser always gives a tree like structure as output

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

Lexer and scanner are two different phases of compiler

In Back End module of compiler, optimal register allocation uses______ .

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

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

____is evaluated to yield a value.

An important component of semantic analysis is _________ .

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

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.

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

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.

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

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

Responsibility of _____ is to produce fast and compact code.

Front end of two pass compiler takes________ as input.

The non-terminal _______ is left recursive.

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

Lexical Analyzer generator _______ is written in Java.

Optimal registers allocation is an NP-hard problem.

Which of the statement is true about Regular Languages?

First of C is ______ .

Compilers are sometimes classified as.

_______ algorithm is used in DFA minimization.

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

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

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

______ phase which supports macro substitution and conditional compilation.

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

Functions of Lexical analyzer are?

LR parsers can handle _______ grammars.

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

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

NFA is easy to implement as compared to DFA.

In Back End module of compiler, optimal register allocation uses______ .

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

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

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

Functions of Lexical analyzer are?

Which of the statement is true about Regular Languages?

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

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

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.