M

Mr. Dubey • 100.69K Points
Coach

Q. Consider the CFG with {S,A,B) as the non-terminal alphabet, {a,b) as the terminal alphabet, S as the start symbol and the following set of production rules
S --> aB S --> bA
B --> b A --> a
B --> bS A --> aS
B --> aBB A --> bAA
Which of the following strings is generated by the grammar?

  • (A) aaaabb
  • (B) aabbbb
  • (C) aabbab
  • (D) abbbba
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. RPC is a _________

Q. Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” a

Q. eHCI indicate

Q. For any positive integer m is divisible by 4.

Q. Which of the following is not a dimension of scalability?

Q. What will be the cross product of the vectors 2i + 3j + k and 3i + 2j + k?

Q. How many step function do Round 1 and 2 each have in S-AES?

Q. Cloud computing is an abstraction based on the notion of pooling physical resources and presenting them as a resource.

Q. systems used to track and identify the location of objects in real time

Q. What is the advantage of selection sort over other sorting techniques?

Question analytics