Computer Science · Compiler Design
Consider the grammar with non-terminals N = {S, C, S1}, terminals T = {a, b, i, t, e}, start symbol S, and the following production rules: S → i C t S S1 | a S1 → e S | ε C → b This grammar is not LL(1) primarily because:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1It is not context-free
- 2It is ambiguous✓
- 3It is right recursive
- 4It is left recursive
Correct answer
It is ambiguous
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 Compiler Design MCQs →Want more practice questions on Compiler Design?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Compiler Design