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 shown below S → i E t S S' | a S' → e S | ε E → b In the predictive parse table. M, of this grammar, the entries M[S', e] and M[S', $] respectively are
a. {S' → e S} and {S' → e}
b. {S' → e S} and {}
c. {S' → ε} and {S' → ε}
d. {S' → e S, S'→ ε} and {S' → ε}
Answer:{S' → e S, S'→ ε} and {S' → ε}
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: