Computer Science · Theory of Computation
Consider the following formal grammars and identify which of them are Context-Free Grammars (CFG) but NOT Regular Grammars: Grammar A: S → Ab A → a Grammar B: S → Ab aS → aA A → Sa A → a Grammar C: S → AS S → aA A → a Grammar D: S → Ab S → aA A → a Grammar E: S → Sb A → Aa A → ε Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A, B, D and E Only
- 2C and E Only✓
- 3C and D Only
- 4A and B Only
Correct answer
C and E 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
Preparing for Computer Science?
Practice full-length Computer Science 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