Looking for GATE Preparation Material? Join & Get here now!
|
|
THEORY OF COMPUTATION
|
|
Q221. Consider the grammar
S--->ABABS|AB
A--->a|aA
B---->b|bB
Let Na(w) and Nb(w) denote the number of a's and b's in a string w. Then the
language L(G) a subset of (a+b)+ generated by G is
A. {w| Na(w)>Nb(w)}
B.{w|Nb(w)<Na(w)}
C.{w|Na(w)=Nb(W)}
D.{w|Nb(w)not related to Na(w)}
Q222.Consider the gramamar.
S--->aaASb|ab
A--->aAb|ab
Let Na(w) and Nb(w) denote the number of a's and b's in a string w. Then the
language L(G) a subset of (a+b)+ generated by G is
A. {w| Na(w)>Nb(w)}
B.{w|Nb(w)<Na(w)}
C.{w|Na(w)=Nb(W)}
D.{w|Nb(w)not related to Na(w)}
Q223. The language {a^n b^n c^n|n>1}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q224. The language {a^i b^j c^k|i>j>k}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q225. The language {a^i b^j c^k|k=min(i,j)}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q226. The language {a^i b^j c^k|k=max(i,j)}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q227. The language {a^n^2|n>1}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q228. The language {a^2^n|n>1}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q229. The language {a^n|n>prime}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q230. The language {a^n|n not prime}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q231. The language {ww|w in (0+1)+}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q232. The language {a^n!|n>1}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q233. The language {a^i b^j c^k|i<>j and j<>k and k<>i}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. can be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Q234. The language {a^i b^j c^k|i=j or j=k or k=i}
a. can be generated by a type 3 grammar
b. can be generated by an LR(k) grammar
c. cannot be generated by a type 2 grammar
d. can be generated by a type 1 grammar
Result Page:- 1-20 |
21-40 |
41-60 |
61-80 |
81-100 |
101-120 |
121-140 |
141-160 |
161-180 |
181-200 |
201-220 |
221-240 |
|
|
|
|
|
|
|
|
|
|
|
Exciting Offers
|
|
|
|
|
|