1 votes 1 votes `How many derivation trees are there to derive string"te" from below grammer:- G->ATE | g | $\epsilon$ A->TE | a | $\epsilon$ T-> t | $\epsilon$ E-> e | $\epsilon$ Compiler Design compiler-design grammar parsing + – rahul sharma 5 asked Oct 14, 2017 retagged Jun 18, 2022 by Lakshman Bhaiya rahul sharma 5 1.6k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Oct 14, 2017 reply Follow Share i am getting 4. 0 votes 0 votes Warlock lord commented Oct 20, 2017 reply Follow Share It's 4. 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes 4 tree are possible Prateek Raghuvanshi answered Oct 14, 2017 selected Oct 20, 2017 by rahul sharma 5 Prateek Raghuvanshi comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes ......... Hira Thakur answered Oct 20, 2017 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.