http://blog.solaris.bytelabs.org/articles/2007/03/06/exploiting-parallelism-in-multi-way-recursive-methods en-us 40 additions to a vast pool of entropy by Igor and Ines <p>My <a href="http://www.ssw.uni-linz.ac.at/Teaching/DiplomaTheses/AutomatischeCodeerzeugung/Aufgabenstellung.pdf">code generator</a> which is still in the prototyping and experimentation phase does <strong>a lot of recursive tree traversals</strong> which is quite obvious since it needs to match tree patterns and emit code for abstract syntax trees (AST).</p> <p>Especially during the code emission phase which does a top down left to right tree traversal it would be nice to recursively evaluate child nodes of an <span class="caps">AST</span> in parallel if the evaluation of the child nodes does not yield any side effects. The following <a href="http://citeseer.ist.psu.edu/31327.html">paper</a> nicely describes how to transform <strong>standard</strong> multi-way recursive methods into <strong>parallel</strong> mutli-way recursive methods in Java.</p> <p>The transformation described is quite simple and works well for direct recursion. However, due to the attribute type grammar I want to use for my tree pattern matching code generator and the way most tree patterns are augmented with semantic actions, it seems that it would cause a bit of a mess, or at least require a lot of careful thinking how to integrate such parallelism into the tree pattern matching grammar and the code generator which is produced by the grammar specification.</p> <p>Unfortunately right now this idea can not be assigned a high priority and must be post-poned&#8230;</p> Tue, 06 Mar 2007 20:58:00 +0000 urn:uuid:3b2d29129dd4f3dd37f6cb5593054fbb igor http://blog.solaris.bytelabs.org/articles/2007/03/06/exploiting-parallelism-in-multi-way-recursive-methods University of Linz Diploma Thesis Hacking and Computers