πŸ“Š Theory of Computation
Q. The following grammar
G = (N, T, P, S)
N = {S, A, B, C, D, E}
T = {a, b, c}
P : S → aAB
AB → CD
CD → CE
C → aC
C → b
bE → bc is
  • (A) is type 3
  • (B) is type 2 but not type 3
  • (C) is type 1 but not type 2
  • (D) is type 0 but not type 1
πŸ’¬ Discuss
βœ… Correct Answer: (C) is type 1 but not type 2

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
595
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
88%
Success Rate