An abstract syntax is a representation of a source code (or data in general) that is independent of the representation of the program in source code, called the syntax ...

An algebraic signature describes the structure of a set of terms. A signature introduces one or more AlgebraicSorts , i.e., collections of terms. Sorts are inhabited ...

Success and failure in Stratego allows one to avoid computing with Boolean values all the time. However, sometimes it is necessary to capture the failure (or success ...

SEARCH{search "CategoryGlossary" nosummary "on" scope "text" noheader "on" nosearch "on" nototal "on" format " $topic "} CategoryCategory

syntax written using prefix constructor terms can become rather unreadable when patterns become large. Therefore it is attractrive to write rules using the concrete ...

A term consisting of a constructor C and subterms ti: C(t1, t2, ..., tn) defines a congruence operator C(s1, s2, ..., sn) This is an operator that first matches a ...

TOC Description A contextual rule is a rule in which the left-hand side and right-hand side terms contain contexts of the form x t . A typical example of a contextual ...

Each rule or strategy applies to an implicit subject term. See versus strategies for a discussion. Visser 13 May 2003 The implicit current subject term is related ...

Transformation systems built with StrategoXT are typically organized using a data-flow architecture. This is rather an implicit notion in the framework, which could ...

The local deterministic choice operator s1 StrategoGlossary

Is their a way to display strategies (or just thier names) from within Stratego. This could be used to add trace monitors to Stratego code. For example: I-str-detectfail ...

A dynamic rule is an ordinary RewriteRule that is generated at run-time. A dynamic rule can inherit bindings of variables from its generation context. Dynamic rules ...

The evaluation order of the alternatives of the NonDeterministicChoice operator is undefined . Improved efficiency of needed definition extraction by using dynamic ...

( this overview is under construction, please contribute! ) .def Foo.def is an SDF definition . An SDF definition is stored in a .def file and is just a bundle of ...

A format checker is a strategy that checks the well-formedness of an term. Format checkers can check more properties than can just be described using signatures. For ...

Generic term deconstruction decomposes a constructor application into its constructor and the list with children. This can be done using the # operator. The match ...

See term traversal Main.EelcoVisser 14 Jun 2003

Added the guarded left choice operator s1 StrategoRelease07

Good layout is important for the readability and hence maintainability of programs. This holds for any programming language. Stratego aims at not only providing a ...

Synonym for the DeterministicChoice operator CategoryGlossary StrategoGlossary

In ListMatching you can use list variables inside a match against a list pattern. List variables are variables followed by a . List variables represent list content ...

The match strategy ?t matches the term pattern t against the current subject term. If the match succeeds all variables in t are bound to the corresponding sub-terms ...

Naming conventions are important in any platform. If the naming conventions are followed in the library and by the developers of a project, you can remember the name ...

The non-deterministic local choice operator s1 s2 chooses one of the strategies s1 or s2 to apply. If the one chose fails, the other one is tried. The operator is ...

A term is in normal form if no rule applies anywhere within the term. This implies that rules are applied everywhere in a term. This is not always appropriate. In ...

for the Stratego Tutorial at ETAPS 2002 language constructs: overview of topics covering constructs of the language Glossary: explanation of terminology Card data ...

Patterns The match strategy ( ? ) Compares the current term to a pattern. A pattern is a term that might contain variables. If a variable in a term pattern is already ...

A printer is a mapping from terms to text. If this is done in a nice way, i.e., layout is placed in appropriate places, the formatter deserves the term pretty printer ...

A rewrite rule has the form Lab : l r where s where Lab is the label or name of the rule, l is the left-hand side term pattern, r the right-hand side term pattern ...

A rewriting strategy is an algorithm for transforming a term with respect to a set of rules. Some rewriting strategies are normalizing strategies, i.e., rewrite a ...

In stratego all information is represented as a ATerm. An ATerm can be thought of as a structured tree-like representation of the information that needs to be transformed ...

Stratego provides scope constructs for several types of data. The variable scope {x1,...,xn:s} delimits the scope of bindings to the term variables xi to the strategy ...

You insist on the importance of separation of concerns, in particular in separation between rules and strategies, so that rules become basic strategies on top of ...

Wij waren op zoek naar een zipWith-achtige functie in stratego; de referentiepagina bevat allemaal harige strategocode waar wij met onze pet niet zo snel bij kunnen ...

This is an overview of topics covering the various constructs in the language. This is a subset of the glossary, which also lists concept, advice, design and tool ...

A StrategoSignature is an AlgebraicSignature . Main.MartinBravenboer 25 Jan 2003

A strategy definition f(x1,...,xn) s defines a strategy operator f with n strategy parameters. An application f(s1,...sn) of this operator is equivalent to let x1 ...

Question: Is there any symbol table implementation in stratego? Yes. There are several ways to go about using symbol table like functionality in Stratego programs ...

SystemS is the name for the system of combinators that form the core of the StrategoLanguage. SystemS is described in the following papers: Program Optimizers with ...

Starting with StrategoRelease093, strategy operators can be passed terms in addition to strategies. Currently, a strategy definition is of the form f(s1, ..., sn) ...

A term traversal is a strategy that visits the subterms of a term in some order. See also traversal strategy term traversal operator

A transformation rule is a description of a single transformation step. Examples of transformation rules are constant folding beta reduction in the lambda calculus ...

See also the WebChanges page. STARTINCLUDE 2010-05-28 Version 0.5 of the Spoofax Language Workbench has been released. Read the announcement on the main page. 2010 ...

Statistics for TWiki.Stratego Web Month: Topic Views: Topic Saves: Attachment Uploads: Most Popular Topic Views: Top Contributors for Topic Save and Uploads: Apr ...

Statistics for TWiki.WebDSL Web Month: Topic Views: Topic Saves: Attachment Uploads: Most Popular Topic Views: Top Contributors for Topic Save and Uploads: Feb 2008 ...