Open In App

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

Like Article
Like
Save
Share
Report

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


Last Updated : 12 Jun, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads