0 votes
1
Consider this grammar: S → SS | a How many derivation trees are possible for a^4 ? (a) 3 (b) 4 (c) 5 (d) 6 Is there any formulae to solve this kind of problem?
0 votes
2
No of switching fn for f (A, B, C, D)=BD+B'D'How to approach this question ?
1 votes
3