The language generated by the given grammar is a 1 followed by an odd number
of zeros.  Note that this can be generated by the following regular grammar:

<pre>
S -> 1A
A -> 0B
B -> 0C
C -> 0B
B -> lambda
</pre>

As an excercise try creating a DFA M such that L(M) consists of all strings
with a 1 followed by an odd number of zeros.<p>