in Theory of Computation edited by
842 views
0 votes
0 votes
Consider this grammar:
S → SS | a
How many derivation trees are possible for a4?
(a) 3 (b) 4
(c) 5 (d) 6

 

how to generalize for any values if a^5 or a^7 is there any general formulae?
in Theory of Computation edited by
842 views

1 Answer

1 vote
1 vote
Best answer

1st possibility :

Second Possibility : 

Third possibility :

Second and third possibilty are possible for RHS side also so total  = 1+ (2+2) = 5

selected by

2 Comments

thanks but is there any generalized formulae?
0
0
No there is no formula.
0
0

Related questions