UGC-NET | UGC NET CS 2015 Dec – III | Question 25
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.
Explanation: The production:
S → aS|Sa|a will generate
So, option (C) is correct.
Quiz of this Question