FLAT -MCQ

Recursively enumerable languages are referred as

• Type 0

• Type 1

• Type 2

• Type 3

Correct hierarchical relationship among context- free, right-linear, and context-sensitive language is

• context-free ⊂ right-linear ⊂ context-sensitive

• context-free ⊂ context-sensitive ⊂ right-linear

• context-sensitive ⊂ right-inear ⊂context-free

• right-linear ⊂context-free ⊂context-sensitive

Statement A : { If aⁿ bⁿ | n = 0,1, 2, 3 ..} is a regular language

Statement B:set of all all strings of equal number of a's and b's deines a regular language

• A is false B is true

• Both statements are false

• Both statements are holds good

• A is true B is false

Following context free grammar

S —> aB | bA

A —>b | aS | bAA

B —> b | bS | aBB

generates strings of terminals that have

• equal number of a's and b's

• odd number of a's and odd number b's

• even number of a's and even number of b's

• odd number of a's and even number of a's

Consider the grammar :

S —> ABCc | Abc

BA —> AB

Bb —> bb

Ab —> ab, with S as start symbol

Aa —> aa

Which of the following sentences can be derived by this grammar

• abc

• aab

• abcc

• abbb

Any string of terminals that can be generated by the following CFG is

S-> XY

X--> aX | bX | a

Y-> Ya | Yb | a

• has atleast one 'b'

• should end in a 'a'

• has no consecutive a's or b's

• has atleast two a's

Which of the following statement is correct?

• All languages can not be generated by CFG

• Any regular language has an equivalent CFG

• Some non regular languages can't be generated by CFG

• both (b) and (c)

Consider a grammar with the following productions

S--> aab | bac | aB

S --> α S | b

S --> α b b | ab

Sα --> bdb | b

The above grammar is

• Context free

• regular

• context sensitive

• LR ( k )

The grammars G = ( { S }, { 0, 1 }, P,S)

where P = (S —> 0S1, S —> 0S, S —> S1, S —>0} is a

• recursively enumerable language

• regular language

• context-sensitive language

• context-free language

The production rules of a grammar G yields a palindrome language $\left\{S\longrightarrow0S0,S\longrightarrow1S1,S\longrightarrow0,\ S\longrightarrow1,S\longrightarrow\epsilon\right\}$  

• yes

• no