Computer Science Fundamentals
Algorithms
Subjective
Feb 25, 2013
When will you call a grammar as the left recursive one?
Detailed Explanation
A grammar is a left recursive if it has a nonterminal A such that there is a derivation A=>Aα for some stringα.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts