wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

CD QUIZ S6 30-3-22

Total questions: 10

Worksheet time: 5mins

Name
Class
Date
1.

Which one of the following is a top-down parser?

a)

Recursive descent parser

b)

Operator precedence parser

c)

An LR(k) parser

d)

An LALR(k) parser

2.

In how many types parsing is divided?

a)

2

b)

3

c)

4

d)

5

3.

To derive a string using the production rules of a given grammar, we use

a)

Scanning

b)

Parsing

c)

Derivation

d)

All of the mentioned

4.

Which of the following parser reaches the root symbol of the tree at last?

a)

Top down parser

b)

Bottom up parser

c)

Top down and Bottom up parser

d)

None of the mentioned

5.

Syntax Analyser is also known as

a)

Hierarchical Analysis

b)

Hierarchical Parsing

c)

Hierarchical Analysis and Parsing

d)

None of the mentioned

6.

Which of the following derivations does a top down parser use while parsing an input string? The input is assumed to be scanned in left to right order

a)

leftmost derivation

b)

leftmost derivation traced out in reverse

c)

Rightmost derivation

d)

Rightmost derivation traced out in reverse

7.

The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called

a)

Assembly

b)

Parsing

c)

Relocation

d)

Symbol resolution

8.

What does a Syntactic Analyser do?

a)

Maintain Symbol Table

b)

Collect type of information

c)

Create parse tree

d)

None of the mentioned

9.

Which of the following pairs have Different expressive power?

a)

Deterministic finite automata(DFA) and Non deterministic finite automata(NFA)

b)

Deterministic Push Down

    Automata (DPDA) and Non Deterministic

    Push down Automata(NPDA)

c)

Deterministic single tape turing machine

    and non deterministic single tape turing

    machine

d)

Single tape turing machine and multitape turing machine

10.

Push down automata accepts which language?

a)

Context sensitive language

b)

Context free language

c)

Recursive language

d)

None of the mentioned