Theory of Computation (3160704) MCQs

MCQs of Context free grammar (CFG)

Showing 31 to 36 out of 36 Questions
1 2 3 4
31.
The production of the form A→B , where A and B are non terminals is called
(a) Null production
(b) Greibach Normal Form
(c) Unit production
(d) Chomsky Normal Form
Answer:

Option (c)

32.
BNF (Backus–Naur form)is one of the notation techniques for
(a) Context free grammar
(b) Context sensitive grammar
(c) Regular grammar
(d) None of these
Answer:

Option (a)

33.
The closure property of context free grammar includes :
(a) Kleene operation
(b) Union
(c) Concatenation
(d) All of the mentioned
Answer:

Option (d)

34.
CFG is not closed under
(a) Kleene
(b) Concatenation
(c) Complement
(d) Union
Answer:

Option (c)

35.
Backus–Naur form (BNF) is useful in
(a) To describe the syntax of languages
(b) Lexical analysis
(c) Semantic analysis
(d) Code optimization
Answer:

Option (a)

36.
Given Grammar G1: S→aSb S→e Grammar G2: R→cRd R→e If L(G)=L(G1) U L(G2), the number of productions the new starting variable would have:
(a) 1
(b) 2
(c) 3
(d) 4
Answer:

Option (b)

Showing 31 to 36 out of 36 Questions
1 2 3 4