Register

parse tree

165 views
0 votes
0 votes
Consider two binary operator ‘+’ and ‘–’ with the precendence of ‘+’ being lower than that of operator ‘–’.Operator ‘–’ is right associative while operator ‘+’ to left associative. What is the parse tree for expression (5 + 2 – 7 + 3 – 4)
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
1
ahmed65956 asked Sep 27, 2023
624 views
10. 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+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9
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...
User Avatar
0 votes
0 votes
3 answers
3
Yogendraa asked Jun 9, 2022
1,094 views
How many parse tree can be constructed for the given ambiguous grammar?
E--> E+E E--> E*E E--> id Input string: id + id + id
E E+EE E*EE idInput string: id + id + id
User Avatar
0 votes
0 votes
0 answers
4
Subhrangsu asked Apr 17, 2022
355 views
Draw Parse tree
Consider the following grammar: S→ a | ^ | ( T ) T→ T , S | S Draw the parse tree for “ (((a,a),^,(a)),a)”
Consider the following grammar:S→ a | ^ | ( T )T→ T , S | SDraw the parse tree for “ (((a,a),^,(a)),a)”
User Avatar
Link Copied!