A DAG. SSA is an example structure implementing it.
On Fri, Nov 27, 2015 at 8:10 AM, Ansar K.A. via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> Hi,
>
> I am planning to implement Common Subexpression Elimination. I want to
> know which data structures will be most suitable.
>
> Regrads,
>
> - Ansar K.A.
>
> _______________________________________________
> LLVM Developers mailing list
> llvm-dev at lists.llvm.org
> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20151127/08353bcb/attachment.html>