Computer Science · Theory of Computation

The maximum yield length of the following Chomsky Normal Form (CNF) Context-Free Grammar (CFG) is: S → AB A → CD B → e C → a D → b

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Correct answer

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Theory of Computation?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Theory of Computation

The Dandi March, also known as the Salt Satyagraha, was led by which influential leader?

Which act formally granted independence to India, marking the end of British rule?

Who was the key figure in establishing the Indian National Congress?

Related Practice Questions