Computer Science Fundamentals
Algorithms
Subjective
Mar 03, 2013
What is (a) CFL (b) Sentential Form?
Detailed Explanation
L is a context free language (CFL) if it is L(G) for some CFG G.
A string of terminals and variables α is called a sentential form if:
S =>α, where S is the start symbol of the grammar.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts