Given a grammar G with start symbol S, we can use the ==> relation to define L(G) , the language generated by G. We say a string of terminals w is in * L(G) if and only if S ==> w. The string w is called a sentence of G. the language that can only generated by a grammar is said to be a context-free language.
