The following CFG is in
S → aBB
B → bAA
A → a
B → b

Related MCQs

• Consider the following CFG S → aB S → bA**spaceB → b A → a**spaceB → bS A → aS**spaceB → aBB A → bAA**space Consider the following derivation **spaceS ⇒aB**space⇒aaBB**space⇒aaBb**space⇒aabSb**space⇒aabbAb**space⇒aabbab**space This derivation is
• The following CFG is in S → aBB**spaceB → bAA**spaceA → a**spaceB → b
• The production Grammar is {S->aSbb,S->abb} is
• The following CFG is in S → AB**spaceB → CD**spaceB → AD**spaceB → b**spaceD → AD**spaceD → d**spaceA → a**spaceC → a
• All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:
• Left hand side of a production in CFG consists of:
• Which of the following strings is not generated by the following grammar? S → SaSbS ε
• Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the computation of M on w visit the state q? Which of the following statements about x is correct?
• Which of the following statement is wrong?
• Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;