Open In App

GATE | GATE-CS-2005 | Question 14

Like Article
Like
Save
Share
Report

The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is

(A)

ambiguous

(B)

left-recursive

(C)

right-recursive

(D)

an operator-grammar


Answer: (A)

Explanation:

Since given grammar can have infinite parse trees for string \’ε\’, so grammar is ambiguous, and also A → AA has left recursion. For predictive-parsing, grammar should be:

  • Free from ambiguity
  • Free from left recursion
  • Free from left factoring

Given grammar contains both ambiguity and left factoring, so it can not have predictive parser. We always expect first grammar free from ambiguity for parsing. Option (A) is more strong option than option (B) here.


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 11 Apr, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads