CS606 Midterm Online Quiz

Parser always gives a tree like structure as output

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

Parser always gives a tree like structure as output

In PASCAL ___________ represent the inequality test.

A _______ is a top down parser.

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

Parser takes tokens from scanner and tries to generate______ .

Left factoring is enough to make LL1 grammar

___________ phase which supports macro substitution and conditional compilation.

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

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

Consider the grammar

In compilation process Hierarchical analysis is also called

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

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

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

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

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.

AST summarizes the grammatical structure with the details of derivations.

Bottom-up parsers handle a ________ class of grammars.

NFA is easy to implement as compared to DFA.

Follow of B is ____ .

Which of the statement is true about Regular Languages?

Left factoring is enough to make LL1 grammar

AST summarizes the grammatical structure with the details of derivations.

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

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

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

Responsibility of _____ is to produce fast and compact code.

Consider the following grammar,

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

Lexer and scanner are two different phases of compiler

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

Lexer and scanner are two different phases of compiler

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

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

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

Functions of Lexical analyzer are?

_______ algorithm is used in DFA minimization.

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.

Parser takes tokens from scanner and tries to generate ______ .

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

45.Follow of C is ____ .

LR parsers can handle _______ grammars.

Lexical Analyzer generator _______ is written in Java.

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

Optimal registers allocation is an NP-hard problem.

Functions of Lexical analyzer are?

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