Jeffrey Hsu wrote:
Is there any interest in a generic implementation of the
Lengauer-Tarjan algorithm to compute the immediate dominator
tree of a flow graph in almost-linear time?
I'd be interested; however, I've no immediate use. I'm only
interested because I'm interested in compilers and analyzing
programs. I also think it would be interesting to see how
you might adapt the boost graph library to do this. The
spirit library could be used for a toy fortran or c like language
to demo the algorithm.
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
