711 views
1 votes
1 votes
The string for which the grammar has maximum of two derivation trees is

(a) lion tiger lion
(c) tiger lion
(b) lion tiger
(d) None of the above

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
ari asked Aug 19, 2015
4,312 views
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
0 votes
2 answers
2
rohankrishan asked Jun 29, 2022
230 views
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
0 votes
0 votes
0 answers
4