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 a³ 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

Article Tags :

UGC-NET

Recommended Articles

1. UGC-NET | UGC NET CS 2015 Dec – III | Question 20

2. UGC-NET | UGC NET CS 2015 Dec – III | Question 1

3. UGC-NET | UGC NET CS 2015 Dec – III | Question 2

4. UGC-NET | UGC NET CS 2015 Dec – III | Question 49

5. UGC-NET | UGC NET CS 2015 Dec – III | Question 3

6. UGC-NET | UGC NET CS 2015 Dec – III | Question 4

7. UGC-NET | UGC NET CS 2015 Dec – III | Question 5

8. UGC-NET | UGC NET CS 2015 Dec – III | Question 6

9. UGC-NET | UGC NET CS 2015 Dec – III | Question 7

10. UGC-NET | UGC NET CS 2015 Dec – III | Question 8

11. UGC-NET | UGC NET CS 2015 Dec – III | Question 9

12. UGC-NET | UGC NET CS 2015 Dec – III | Question 10

13. UGC-NET | UGC NET CS 2015 Dec – III | Question 11

14. UGC-NET | UGC NET CS 2015 Dec – III | Question 12

15. UGC-NET | UGC NET CS 2015 Dec – III | Question 13

16. UGC-NET | UGC NET CS 2015 Dec – III | Question 14

17. UGC-NET | UGC NET CS 2015 Dec – III | Question 15

18. UGC-NET | UGC NET CS 2015 Dec – III | Question 16

19. UGC-NET | UGC NET CS 2015 Dec – III | Question 17

20. UGC-NET | UGC NET CS 2015 Dec – III | Question 18

21. UGC-NET | UGC NET CS 2015 Dec – III | Question 19

22. UGC-NET | UGC NET CS 2015 Dec – III | Question 21

23. UGC-NET | UGC NET CS 2015 Dec – III | Question 22

24. UGC-NET | UGC NET CS 2015 Dec – III | Question 23

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