1. 1 Groove demo (sf.net/projects/groove) Arend Rensink, University of Twente Computer Automated Multi-Paradigm Modelling, April 2012 April 2012Computer Automated Multi- Paradigm Modelling

2. 2 Imperative single-linked list language  P:=B(main Block)  B:={ S* }  S:=V(Variable declaration) |B |if (C) S (else S)? |while (C) S |T := E;(Expression assigned to Target)  V:=var ID*;  C:=E = E | E != E (simple boolean Conditions)  T:=ID | ID^  E:=ID | ID^ |null |new ID? (optionally named object creation) April 2012

3. Computer Automated Multi-Paradigm Modelling 3 Example: List reversal  Program fragment  while (v != null) { var t; t := w; w := v; v := v^; w^ := t; }  Global variables  v: contains the initial list  w: should contain the result list, initially null April 2012

4. Computer Automated Multi-Paradigm Modelling 4 Overall framework for GT semantics  Operational rules manipulate run-time graph  Track program (control) location  Perform data manipulation  Add & delete heap slots  Add & delete method frames Program Graph: - constructed from AST - control flow added - variables resolved Run-Time Graph: - data values - heap structure - stack structure fixed dynamic points to April 2012

5. Computer Automated Multi-Paradigm Modelling 5 Extended flow type graph  Basic flow graph  Expressions  Conditions  Assignments April 2012