For unambiguous grammar b)

The Gateway to Computer Science Excellence

0 votes

Let G be a CFG , l be the number of left most derivations , r be the number of right most derivations and p be the number of parse trees.Assume l , p , r are computed for a particular string . For a given CFG 'G' and given string 'w'. What is the relation between l , p and r

a) l <=p<=r

b)l=p=r

c)l>=p<=r

d)none

a) l <=p<=r

b)l=p=r

c)l>=p<=r

d)none

0 votes

For a particular string, there can be just one Leftmost derivation, and just one Rightmost derivation. So, l = r.

Now, both the derivations translate into the same parse tree. But in case of ambiguous grammars, there can be more than one parse trees. However, RMD and LMD for a particular string remain just one.

Hence, l = r $\leq$ p

So, none of the above.

* Option D*.

Assuming the grammar is unambiguous, *Option B*.

52,375 questions

60,597 answers

202,015 comments

95,412 users