Consider the following SDD:
E → E1 * E2 { E.val = E1.val * E2.val }
E → id { E.val = len(id.lexeme); E.len = E.val }
E → E1 + E2 { E.val = E1.len + E2.val; E.len = E.val }
For input:
a + bb * c
( len("a")=1 , len("bb")=2 , len("c")=1 )
What will be the final value of E.val if evaluated with a correct dependency graph order ?

Question

Consider the following SDD: 
 E → E1 * E2   { E.val = E1.val * E2.val } 
 E → id        { E.val = len(id.lexeme); E.len = E.val } 
 E → E1 + E2   { E.val = E1.len + E2.val; E.len = E.val } 
 For input: 
 a + bb * c 
 ( len("a")=1 ,  len("bb")=2 ,  len("c")=1 ) 
 What will be the final value of  E.val  if evaluated with a  correct dependency graph order ?

Answer

1 + (2 * 1) = 3, but only if  E.len  is computed before  E.val  in  +  rule

Answer

(1 + 2) * 1 = 3

Answer

1 + (2 * 1) = 3

Answer

Evaluation order fails due to circular dependency

Crowdly

Consider the following SDD: E → E1 * E2 { E.val = E1.val * E2.val } E → id...

Want instant access to all verified answers on moovit.vit.ac.in?