Computer Science · Theory of Computation
A context-free grammar G is in Chomsky Normal Form (CNF) if every production rule is of the form:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1None of these
- 2A → BCa or B → b
- 3A → BC or A → a✓
- 4A → BC or A → A
Correct answer
A → BC or A → a
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation