|
This transformation presents a basic example where a tree is transformed into a list. This kind of transformation is usually made by an
imperative Depth First Traversal algorithm.
ATL concepts encountered:
Matched rules (one with a guard),
Helper functions (one being recursive),
Collection related functions,
Enumeration, and
ATL resolve algorithm.
Article Tree to List
July 2007
by Cyril Faure (C-S), Freddy Allilaire (INRIA)
Source code Tree to List
July 2007
by Cyril Faure (C-S), Freddy Allilaire (INRIA)
|