Computer Science · Theory of Computation
Which of the following statements is/are true? S1: Every left-recursive grammar can be converted to a right-recursive grammar and vice versa. S2: The derivation trees of strings generated by a context-free grammar in Chomsky normal form are always almost complete binary trees. S3: Every subset of a recursively enumerable set is recursive.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1S1, S2 and S3
- 2Only S1 and S3
- 3Only S1 and S2
- 4Only S1✓
Correct answer
Only S1
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