MCQOPTIONS
Saved Bookmarks
| 1. |
LL grammar for the language L = {an bm cn+m | m=0, n=0} is |
| A. | S ? aSc | S1; S1 ? bS1c | ? |
| B. | S ? aSc | S1| ; S1 ? bS1c |
| C. | S ? aSc | S1| ?; S1 ? bS1c| ? |
| D. | S ? aSc | ?; S1 ? bS1c| ? |
| Answer» D. S ? aSc | ?; S1 ? bS1c| ? | |