CS606 Midterm Online Quiz

0%

CS606-Midterm

1 / 50

Consider the grammar

2 / 50

____is evaluated to yield a value.

3 / 50

LR parsers can handle _______ grammars.

4 / 50

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

5 / 50

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

6 / 50

Front end of two pass compiler takes________ as input.

7 / 50

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

8 / 50

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.

9 / 50

LR parsers can handle _______ grammars.

10 / 50

Consider the grammar

11 / 50

Lexical Analyzer generator _______ is written in Java.

12 / 50

Lexical Analyzer generator _______ is written in Java.

13 / 50

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

14 / 50

AST summarizes the grammatical structure with the details of derivations.

15 / 50

Optimal registers allocation is an NP-hard problem.

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

NFA is easy to implement as compared to DFA.

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

Bottom-up parsers handle a ________ class of grammars.

25 / 50

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

26 / 50

____________avoid hardware stalls and interlocks.

27 / 50

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

28 / 50

Parser always gives a tree like structure as output

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Responsibility of _____ is to produce fast and compact code.

33 / 50

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

34 / 50

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

35 / 50

In PASCAL ___________ represent the inequality test.

36 / 50

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

37 / 50

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

38 / 50

______ phase which supports macro substitution and conditional compilation.

39 / 50

LR parsers can handle _______ grammars.

40 / 50

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

41 / 50

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

42 / 50

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

43 / 50

Parser takes tokens from scanner and tries to generate______ .

44 / 50

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

45 / 50

An important component of semantic analysis is _________ .

46 / 50

Parser takes tokens from scanner and tries to generate ______ .

47 / 50

In predictive parsing table the rows are ___________ .

48 / 50

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

49 / 50

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.

50 / 50

Optimal registers allocation is an NP-hard problem.

Your score is

The average score is 0%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi