| |
| | Program Transformation (Site not responding. Last check: 2007-10-12) |
 | | Program transformations are usually semantics- (or "correctness-") preserving [optimization, translation, refinement, refactoring,...] but can be used to alter the semantics of the a "program" (language instance) [add a parameter to a procedure, adjust all array bounds by one, remove all code related to a function,...]. |
 | | Procedural program transformations are bits of procedural code (written in conventional languages such as C++ or LISP) that navigate around the structures (e.g., crawling over the tree graph) by explicitly specifying checks for node types and transitions across arcs, and specify individual changes to node types and arcs. |
 | | Writing source-to-source transformation systems is considerably harder, because of the need to implicitly extract the structure from the pattern, carry out the structure matching, application condition checking, and update the structures, but it should be clear that source-to-source transformation systems are easier to use. |
| semdesigns.com /Products/DMS/ProgramTransformation.html?Home=DMSToolkit (1461 words) |
|