Effective strategic programming for Java developers. (4th October 2012)

• Record Type: Journal Article
• Authors: Balland, Emilie; Moreau, Pierre‐Etienne; Reilles, Antoine
• Is Part Of: Software, practice & experience. Volume 44:Number 2(2014)
• Page Start: 129
• Page End: 162
• Publication Date: 2012-10-04
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2159
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2159-abs-0001"> <title>SUMMARY</title> <p id="spe2159-para-0001">In object programming languages, the <italic>Visitor</italic> design pattern allows separation of algorithms and data structures. When applying this pattern to tree‐like structures, programmers are always confronted with the difficulty of making their code evolve. One reason is that the code implementing the algorithm is interwound with the code implementing the traversal inside the visitor. When implementing algorithms such as data analyses or transformations, encoding the traversal directly into the algorithm turns out to be cumbersome as this type of algorithm only focuses on a small part of the data‐structure model (e.g., program optimization). Unfortunately, typed programming languages like Java do not offer simple solutions for expressing generic traversals. Rewrite‐based languages like ELAN or Stratego have introduced the notion of <italic>strategies</italic> to express both generic traversal and rule application control in a declarative way. Starting from this approach, our goal was to make the notion of <italic>strategic programming</italic> available in a widely used language such as Java and thus to offer generic traversals in typed Java structures. In this paper, we present the strategy language <sans-serif>SL</sans-serif> that provides programming support for strategies in Java. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p> </abstract>