278 views

1 Answer

Related questions

1 votes
1 votes
3 answers
1
spriti1991 asked Mar 18, 2015
2,346 views
Consider the SDT , where S ->TR, R- +TR|empty {print ("+")} , And T- num {print(num)} And if the input is given "9+5+2" What is output ?
1 votes
1 votes
0 answers
2
0 votes
0 votes
0 answers
3
ahmed65956 asked Sep 27, 2023
584 views
Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...
2 votes
2 votes
1 answer
4
Ashwani Kumar 2 asked Apr 20, 2016
12,592 views
The LL(1) parsing table for the above grammar is Nonterminalabeit$SS->a S->iEtSS' S' S' ->epsilonS' ->es S'->epsilonE E->b By looking the parse table we found mult...