K. Olmos and E. Visser. Strategies for Source-to-Source Constant Propagation. In B. Gramlich and S. Lucas (editors) _Second International Workshop on Reduction Strategies in Rewriting and Programming(WRS'02)._ Electronic Notes in Theoretical Computer Science vol. 70 No. 6. Elsevier Science Publishers, Copenhagen, Denmark. July 2002. URL: http://www.elsevier.nl/locate/entcs/volume70.html *Abstract* Data-flow optimizations are usually implemented on low-level intermediate representations. This is not appropriate for source-to-source optimizations, which reconstruct a source level program after transformation. In this paper we show how constant propagation, a well known data-flow optimization problem, can be implemented on abstract syntax trees in Stratego, a rewriting system extended with programmable rewriting strategies for the control over the application of rules and dynamic rewrite rules for the propagation of information. *Technical report* * http://www.cs.uu.nl/~visser/ftp/OV02.pdf *Resources* * [[Stratego.WebHome][Stratego]] * [[Tiger.WebHome][Tiger in Stratego]] * [[Constant propagation]] *BibTeX* @InProceedings{OV02, author = {Karina Olmos and Eelco Visser}, title = {Strategies for Source-to-Source Constant Propagation}, booktitle = {Workshop on Reduction Strategies (WRS'02)}, pages = 20, year = 2002, editor = {B. Gramlich and S. Lucas}, volume = 70, number = 6, series = {Electronic Notes in Theoretical Computer Science}, address = {Copenhagen, Denmark}, month = {July}, publisher = {Elsevier Science Publishers}, note = {\url{http://www.elsevier.nl/locate/entcs/volume70.html}} } ----- Transform.CategoryPaper