Skip to content
Related Articles

Related Articles

Save Article
Improve Article
Save Article
Like Article

UGC-NET | UGC NET CS 2015 Dec – III | Question 25

  • Last Updated : 12 Jun, 2018

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 a3 can be generated by __________ different trees.
(A) two
(B) three
(C) four
(D) five

Answer: (C)

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

So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :