Direct Acyclic Graph(DAG): Example
9/69
•
Parse tree for
x
=
a
*
b
+
a
*
b
:
S
•
DAG for
x
=
a
*
b
+
a
*
b
:
E
E
E
=
*
i
i
i
x
=
a
*
b
*
i
i
a
*
b
+
+
E
E
E
E
E
x
=
*
+
E
a
E
b
Note:
DAG has no redundant nodes.