retagged by
1,592 views
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$
retagged by

2 Answers

Related questions

–1 votes
–1 votes
1 answer
1
1 votes
1 votes
1 answer
2
shikharV asked Nov 19, 2015
400 views
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
2 votes
2 votes
0 answers
3
rahul sharma 5 asked Oct 14, 2017
1,495 views
Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?
6 votes
6 votes
7 answers
4
srestha asked Apr 16, 2016
7,150 views
Consider the grammar given belowS⟶ SS | a | ∈The number of inadequate states in the DFA of LR(1) items is(a) 1 (b) 2 (c) 3 (d) 4