Computer Science · Theory of Computation
Which of the following Context-Free Grammars is in Chomsky Normal Form (CNF)?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S → AB | BC | CD, A → 0, B → 1, C → 2, D → 3✓
- 2S → AB, S → BCA | 0 | 1 | 2 | 3
- 3S → ABa, A → aab, B → Ac
- 4S → aSb, S → ab
Correct answer
S → AB | BC | CD, A → 0, B → 1, C → 2, D → 3
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