Register

Find out the number of rightmost derivations

• edited by
743 views
3 votes
3 votes

Why only one derivation??

                S->   E  ->  E+E  ->  E+a  ->  a+a

                S->  E+E  ->  E+a  ->  a+a

Are these two derivations possible??

• edited by
User Avatar

2 Answers

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
2
A_i_$_h asked Nov 10, 2017
2,028 views
Derivations
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
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...
User Avatar
–1 votes
–1 votes
1 answer
3
iita asked Feb 3, 2017
6,065 views
number of steps in derivation
User Avatar
1 votes
1 votes
1 answer
4
shikharV asked Nov 19, 2015
412 views
Finding number of right derivation
Given answer: 1 I am able to get 2 rightmost derivation of 'a+a' First: S -> E + E -> E + a -> a + a Second: S -> E + E -> E + a -> a + a Total derivation -> 2
Given answer: 1I am able to get 2 rightmost derivation of 'a+a'First:S - E + E - E + a - a + aSecond:S - E + E - E + a - a + aTotal derivation - 2
User Avatar
Link Copied!