CS606 Midterm Online Quiz

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

Lexer and scanner are two different phases of compiler

A _______ is a top down parser.

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

Consider the following grammar,

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

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

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

Left factoring is enough to make LL1 grammar

LR parsers can handle _______ grammars.

Functions of Lexical analyzer are?

Parser always gives a tree like structure as output

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

LR parsers can handle _______ grammars.

In compilation process Hierarchical analysis is also called

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.

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

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

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

Functions of Lexical analyzer are?

___________ phase which supports macro substitution and conditional compilation.

Responsibility of _____ is to produce fast and compact code.

In PASCAL ___________ represent the inequality test.

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

Bottom-up parsers handle a ________ class of grammars.

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

Lexical Analyzer generator _______ is written in Java.

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

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.

____________avoid hardware stalls and interlocks.

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.

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

Follow of B is ____ .

Which of the statement is true about Regular Languages?

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

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

Optimal registers allocation is an NP-hard problem.

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

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

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

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.

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

Compilers are sometimes classified as.

In predictive parsing table the rows are ___________ .

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

NFA is easy to implement as compared to DFA.

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

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