A parse tree showing attributes at its nodes is called

a$.$ A Directed Acyclic Graph

b$.$ A Syntax Tree

c$.$ An annotated Parse tree

d$.$ A syntax Translation schemeConsider the following example of an SDD: If A $->$ BCD$,$ then C$.$val $=$ A$.$val, C$.$val $=$ B$.$val, C$.$val $=$

D$.$val. What is true about this SDD$?$