Sunday, 14 June 2015

Q7,Paper2 ,J14. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?



(A) Removing left recursion alone
(B) Removing the grammar alone
(C) Removing left recursion and factoring the grammar
(D) None of the above 
Answer D.
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)