Compiler Design Multiple Choice Questions and Answers - 3

Question: 11

___ grammars are not phase structured grammar.

(A) Regular

(B) Context free

(C) Context sensitive

(D) None of these

Ans: D

None of these

Question: 12

The parsing technique that avoids backtracking is

(A) Top-down parsing

(B) Recursive-descent parsing

(C) Predictive parsing

(D) Both (b) and (c)

Ans: D

Both (b) and (c)

Question: 13

CSG (COntext Sensitive Grammar) can be recognized by

(A) Push down automata

(B) Finite state automata

(C) 2-way linear bounded automata

(D) All of the above

Ans: C

2-way linear bounded automata

Question: 14

Which of the following symbol table implementation is based on the property of locality of reference?

(A) Linear list

(B) Self-organizing list

(C) Search tree

(D) Hash table

Ans: B

Self-organizing list

Question: 15

The process of searching for matched tokens is typically described using ___

(A) Finite automata

(B) Regular expressions

(C) Context free grammar

(D) Both a and b

Ans: D

Both a and b

Related Questions