Solving the TTC 2011 Reengineering Case with GReTL

TL;DR

This paper presents a GReTL-based solution for the TTC 2011 Reengineering case, demonstrating how to extract a state machine model from a Java syntax graph, including core and extension tasks.

Contribution

It introduces a GReTL approach for reengineering Java syntax graphs into state machine models, covering core and extension tasks.

Findings

Successfully extracted state machine models from Java syntax graphs.

Demonstrated GReTL's effectiveness in reengineering tasks.

Provided a comprehensive reference solution for the case.

Abstract

This paper discusses the GReTL reference solution of the TTC 2011 Reengineering case. Given a Java syntax graph, a simple state machine model has to be extracted. The submitted solution covers both the core task and the two extension tasks.