Computer Science · Theory of Computation
Which of the following Context-Free Grammars (CFGs) is/are strictly in Chomsky Normal Form (CNF)? (All capital letters are variables, and lower-case letters are terminals) A. S → ABC | AB; A → a; B → b; C → d B. X → RT | TR; T → t; R → XT | r C. P → qP | sQ; Q → r | s D. M → MN | MP; N → nm | n; P → p Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1B & D only
- 2C only
- 3B only✓
- 4A & B only
Correct answer
B only
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