833 views
0 votes
0 votes
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?

1 Answer

4 votes
4 votes
For any unambiguous grammar,

 #LMD = #RMD = #Parse tree = 1

For ambiguous grammar,

#LMD = #RMD <= #Parse tree
edited by

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
0 answers
2