Boost logo

Boost :

Subject: Re: [boost] Boost.Graph Metagraph project
From: Joel Falcou (joel.falcou_at_[hidden])
Date: 2011-01-24 07:14:27

On 24/01/11 09:30, Eric Niebler wrote:
> On 1/24/2011 2:17 PM, Joel Falcou wrote:
>> Jumping again here. What are th eimpact of said algorithm on compile
>> time ? Is there a way we can handle DAG in a meaningful way ? My
>> experiences with rpoto lead me to think that we need some CT-DAG to get
>> more out of our proverbial proto AST.
> Can you share details? What are you trying to do, Joel?

Some advanced compilation techniques require a directed acyclic graph
instead of an AST. DAG usually helps to find basic blocks and other
fundamental code fragment. We want to get down to this level for some
fine grain parallelization task in real-time constraints code generation
where we may need to split series of statement in non-trivial way. In
this case, the DAG allow us to "see" where the code can be splitted
without error.

As i never found how to make some CT structure looking like an AST but
with a way to get the parent node, DAG is next best thiung we have in store

Boost list run by bdawes at, gregod at, cpdaniel at, john at