CS606 Midterm Online Quiz

0%

CS606-Midterm

1 / 50

Lexical Analyzer generator _______ is written in Java.

2 / 50

Lexer and scanner are two different phases of compiler

3 / 50

Front end of two pass compiler takes________ as input.

4 / 50

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

5 / 50

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

6 / 50

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

7 / 50

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

8 / 50

Parser takes tokens from scanner and tries to generate______ .

9 / 50

Parser always gives a tree like structure as output

10 / 50

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

11 / 50

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

12 / 50

Parser always gives a tree like structure as output

13 / 50

Lexical Analyzer generator _______ is written in Java.

14 / 50

Lexer and scanner are two different phases of compiler

15 / 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.

16 / 50

In predictive parsing table the rows are ___________ .

17 / 50

Can a DFA simulate NFA?

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

Parser takes tokens from scanner and tries to generate ______ .

23 / 50

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

24 / 50

For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.

25 / 50

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

26 / 50

Optimal registers allocation is an NP-hard problem.

27 / 50

Responsibility of _____ is to produce fast and compact code.

28 / 50

Functions of Lexical analyzer are?

29 / 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.

30 / 50

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

31 / 50

NFA is easy to implement as compared to DFA.

32 / 50

LR parsers can handle _______ grammars.

33 / 50

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

34 / 50

First of C is ______ .

35 / 50

_______ algorithm is used in DFA minimization.

36 / 50

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

37 / 50

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

38 / 50

___________ phase which supports macro substitution and conditional compilation.

39 / 50

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

40 / 50

A lexical analyzer generator automatically constructs a _____ that recognizes tokens.

41 / 50

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

42 / 50

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

43 / 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

44 / 50

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

45 / 50

Compilers are sometimes classified as.

46 / 50

In predictive parsing table the rows are ___________ .

47 / 50

NFA is easy to implement as compared to DFA.

48 / 50

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

49 / 50

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

50 / 50

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

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