December2015 cs Q24

0. The language of all non-null strings of a’s can be defined by a context free grammar as follow: S → aS|Sa|a The word a³ can be generated by __________ different trees.

Answer
Comment
Array

Option : C
Explanation :
The production: S → aS|Sa|a will generate

So, option (C) is correct

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.