Dependency Graph│Compiler Design│Part# 32│Learn CSE Malayalam

A dependency graph depicts the flow of information in an annotated parse tree. It shows the order of evaluation of each node in a tree. For a synthesized attribute, an edge in a dependency graph is generated from the child node to the parent node in which the child node is used to compute the parent. Whereas in inherited attribute the edge is generated from a node to another node, in which the tail of the edge generate the head of the edge. A topological sort is required in dependency graph to compute the final result. No graph with cycle can generate a final result and then also there is no way to evaluate the SDD. S attributed SDD are those which guarantee atleast one topological sort all the time. Syntax Directed Definition : https://www.youtube.com/watch?v=UmbboE4mdbU&t=1496s 01:00 : Dependency Graph 02:26 : Dependency graph for Synthesized attribute 03:39 : Dependency graph example for Synthesized attribute 06:31 : Dependency graph for Inherited attribute 07:30 : Dependency graph example for Inherited attribute 13:08 : Topological Sort Please comment your suggestions & required topics. Mail us to : [email protected] Follow us in : https://www.facebook.com//LearnCseMalayalam