Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

GATE | GATE-CS-2005 | Question 14

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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








an operator-grammar

Answer: (A)


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

My Personal Notes arrow_drop_up
Last Updated : 11 Apr, 2018
Like Article
Save Article
Similar Reads