Given the following SDD:
S → A B
A → id { A.val = length(id.lexeme); B.inh = A.val }
B → num { B.val = B.inh + num.val; S.val = B.val }
For input:
x 5
where length("x") = 1 and num.val = 5 .
Which is the correct evaluation order to avoid circular dependencies?

Question

Given the following SDD: 
 S → A B 
 A → id   { A.val = length(id.lexeme); B.inh = A.val } 
 B → num  { B.val = B.inh + num.val; S.val = B.val } 
 For input: 
 x 5 
 where  length("x") = 1  and  num.val = 5 . 
 Which is the  correct evaluation order  to avoid circular dependencies?

Answer

Compute  B.inh , then  A.val , then  B.val , finally  S.val .

Answer

Circular dependency exists; no valid evaluation order is possible.

Answer

Compute  A.val , then  B.inh , then  B.val , finally  S.val .

Answer

Compute  B.val  first, then  A.val , then  B.inh , then  S.val .

Crowdly

Given the following SDD: S → A B A → id { A.val = length(id.lexeme); B.inh...

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