Solved Paper-II On Topic : Solved Paper-II June 2006

Que : 1 . Which of the following strings is in the language defined by grammar S→0A, A→1A/0A/1

1. 01100
2. 00101
3. 10011
4. 11111
Please Select Ans Options .
Explanation

Option 2 is Correct Answer.
Above rules produces the strings starts with 0 and end with 1.
S-->0A, where A= OA
A-->1A/0A/1;
S --> 0A
S --> 0 0A
S --> 00 1A where A= 1A
S --> 001 0A Where A= OA
S --> 00101