Homework answers / question archive / Consider the following SDD: X -> X ? Y { X

Consider the following SDD: X -> X ? Y { X

Computer Science

Share With

---

Consider the following SDD:

X -> X ? Y { X.val = X.val x Y.val }

X -> Y { X.val = Y.val }

Y -> Y & Z { Y.val = Y.val + Z.val }

Y -> Z { Y.val = Z.val }

Z -> num { Z.val = num.lexval }

1. Generate an annotated parse tree for the input 2 ? 3&5 ? 6&4

2. What is the output of the given input for the above SDD?