|Efficient Implementation of Guarded Commands email@example.com (Peter H. Froehlich) (2002-04-16)|
|Re: Efficient Implementation of Guarded Commands firstname.lastname@example.org (Joachim Durchholz) (2002-04-17)|
|From:||Joachim Durchholz <email@example.com>|
|Date:||17 Apr 2002 23:16:39 -0400|
|Posted-Date:||17 Apr 2002 23:16:39 EDT|
Peter H. Froehlich wrote:
> Does anyone know of papers, technical reports, books (?) that describe
> the efficient implementation (read "compilation") of guarded commands?
I think the main problem is identifying common subexpressions in the
guards. Once you have them, you can topologically sort the guards (A < B
iff all subexpressions of A are also used in B).
Identifying common subexpressions should be a common algorithmic
optimization, but I don't know how this is done.
Return to the
Search the comp.compilers archives again.