A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider the grammar with non-terminals N = {S,C,S1 },terminals T={a,b,i,t,e}, with S as the start symbol, and the following set of rules:

S --> iCtSS1|a
S1 --> eS|ϵ
C --> b

The grammar is NOT LL(1) because:
a. it is left recursive
b. it is right recursive
c. it is ambiguous
d. It is not context-free
Answer:it is ambiguous
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: