Computer Science · Theory of Computation
The reduced grammar equivalent to the grammar whose production rules are given below is: S → AB | CA B → BC | AB A → a C → aB | b
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S → CA, A → a, C → b✓
- 2S → CA | B, B → BC | B, A → a, C → aB | b
- 3S → CA | B, B → BC, A → a, C → aB | b
- 4S → AB | AC, B → BC | BA, A → a, C → aB | b
Correct answer
S → CA, A → a, C → b
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