• Every grammar in Chomsky Normal Form is:

a) regular
b) context sensitive
c) context free
d) all of the mentioned
• Answer: c
Explanation: Conversely, every context frr
grammar can be converted into Chomsky
Normal form and to other forms.
• Let G be a grammar. When the production in
G satisfy certain restrictions, then G is said to
be in ___________.
a) restricted form
b) parsed form
c) normal form
d) all of the mentioned
• The format: A->aB refers to which of the
following?
a) Chomsky Normal Form
b) Greibach Normal Form
c) Backus Naur Form
d) None of the mentioned
Q
The Greibach normal form grammar for the language L = {an bn+1 |
u
n ≥ 0 } is
e.
a. S → aSB, B →bB I λ
b. S → aSB, B →bB I b
c. S → aSB I b, B→b
d. S → aSB I b
• Answer:S → aSB I b, B→b
• Every Context Free Grammar can be
converted to:
• i) Greibach Normal Form
• ii) Chomsky Normal Form
• iii) Both I & ii
• iv) All of the above
The language A → tB | t generated by which of the
following grammar?
(A) Type 0

(B) Type 1

(C) Type 2

(D) Type 3
 The difference between number of states with
regular expression (a + b) and (a + b) * is:
a) 1
b) 2
c) 3
d) 0
• Answer: a
Explanation:
Production Rule: aAb->agb belongs to which of
the following category?
a) Regular Language
b) Context free Language
c) Context Sensitive Language
d) Recursively Ennumerable Language
• Answer: c
What the does the given CFG defines?
S->aSbS|bSaS|e and w denotes terminal
a) wwr
b) wSw
c) Equal number of a’s and b’s
d) None of the mentioned
• Answer: c
• L={0i1j2k | j>i+k}
Which of the following satisfies the language?
a) 0111100
b) 011100
c) 0001100
d) 0101010
• Answer: a
• The minimum number of states required to
automate the following Regular Expression:
(1) *(01+10) (1) *
a) 4
b) 3
c) 2
d) 5
• Answer: a