CS606 Midterm Online Quiz

Lexical Analyzer generator _______ is written in Java.

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

Lexical Analyzer generator _______ is written in Java.

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

______ phase which supports macro substitution and conditional compilation.

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

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

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

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

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.

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

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

In Flex specification file different sections are separated by ________ .

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

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

LR parsers can handle _______ grammars.

___________ phase which supports macro substitution and conditional compilation.

LR parsers can handle _______ grammars.

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

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

Left factoring is enough to make LL1 grammar

Bottom-up parsers handle a ________ class of grammars.

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

Functions of Lexical analyzer are?

_______ algorithm is used in DFA minimization.

Parser takes tokens from scanner and tries to generate______ .

NFA is easy to implement as compared to DFA.

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

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

In predictive parsing table the rows are ___________ .

Lexer and scanner are two different phases of compiler

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

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

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

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

Can a DFA simulate NFA?

A _______ is a top down parser.

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

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

Optimal registers allocation is an NP-hard problem.

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

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.

Compilers are sometimes classified as.

The non-terminal _______ is left recursive.

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

Front end of two pass compiler takes________ as input.

Parser takes tokens from scanner and tries to generate ______ .

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

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

An important component of semantic analysis is _________ .