Ch 3.11:DAG examples| Compiler Design lecture for GATE CSE
In this lecture i discussed DAG(Directed Acyclic Graphs) for following examples
Shows the DAG for the expression
Ex 2: (a+b)*(a+b+c)
Ex 3:((x+y)-((x+y)*(x-y)))+((x+y)*(x-y))
Ex 4:a+b+(a+b)
Ex 5:a+b+a+b
Ex 6:a+a+(a+a+a+(a+a+a+a))
Ex 7:
a=b+c
d=b+a
e=d+a
Ex 8:
a=b+c
b=a-d
c=b+c
d=a-d
Ex 9:
d=b*c
e=a+b
b=b*c
a=e-d
----------------------------------------------------
Subscribe my channel for more updates / monalisacs
----------------------------------------------------------
Join Telegram GATE CS study group: https://t.me/MonalisaCS
----------------------------------------------------------------
Compiler Design Lectures : • Ch 1.1:Language Processing System |CD Lect...
----------------------------------------------------------------
Compiler Design PYQ : • Ch 1.1:Language Processing System |CD Lect...
----------------------------------------------------------------------
Theory Of Computation Lectures • Video
-------------------------------------------------------------------
TOC GATE PYQ: • GATE CS 2010,Q39:Let L={w ∈ (0 + 1)* | w h...
-------------------------------------------------------------------
Data Structure Lecture: • Data Structure Syllabus for GATE
---------------------------------------------------------------------
Data Structure PYQ: • Data Structure Syllabus for GATE
-----------------------------------------------------------------------
#DAG#Intermediate_Code_Generation#Compiler_Design