Introduction

DAG Generator is a tool which gives a Directed Acyclic Graph for a given Infix Expression. This is a mini project as a part of Compiler Design course.

What's the flow?

• Infix Expression is given.
• Postfix Expression is found from Infix Expression.
• Three Address format is found out from the Postfix Expression.
• The Three Address Format is represented as a Directed Acyclic Graph.

Example

Let the Three Address format be:

1. t0 = a + b
2. t1 = t0 + c
3. d = t0 + t1

Please refer here