merging (meta-)models works (but it's dirty!)
This commit is contained in:
parent
c31c8bf3ea
commit
9883e09ac2
17 changed files with 474 additions and 46 deletions
|
|
@ -2,41 +2,51 @@ from uuid import UUID
|
|||
from transformation.rule import RuleMatcherRewriter
|
||||
from transformation.ramify import ramify
|
||||
from util.loader import load_rules
|
||||
from util.timer import Timer
|
||||
from concrete_syntax.textual_od.renderer import render_od
|
||||
|
||||
import os
|
||||
THIS_DIR = os.path.dirname(__file__)
|
||||
|
||||
# Given a class diagram, extend it (in-place) with a "Top"-type, i.e., an (abstract) supertype of all types. The set of instances of the "Top" is always the set of all objects in the diagram.
|
||||
def topify_cd(state, cd: UUID):
|
||||
# meta-meta-model
|
||||
scd_mmm = UUID(state.read_value(state.read_dict(state.read_root(), "SCD")))
|
||||
class Topifier:
|
||||
def __init__(self, state):
|
||||
self.state = state
|
||||
# meta-meta-model
|
||||
self.scd_mmm = UUID(state.read_value(state.read_dict(state.read_root(), "SCD")))
|
||||
self.scd_mmm_ramified = ramify(state, self.scd_mmm)
|
||||
self.matcher_rewriter = RuleMatcherRewriter(state, self.scd_mmm, self.scd_mmm_ramified)
|
||||
|
||||
scd_mmm_ramified = ramify(state, scd_mmm)
|
||||
# topification is implemented via model transformation
|
||||
self.rules = load_rules(state,
|
||||
lambda rule_name, kind: f"{THIS_DIR}/rules/r_{rule_name}_{kind}.od",
|
||||
self.scd_mmm_ramified, ["create_top", "create_inheritance"],
|
||||
check_conformance=False,
|
||||
)
|
||||
|
||||
matcher_rewriter = RuleMatcherRewriter(state, scd_mmm, scd_mmm_ramified)
|
||||
|
||||
# topification is implemented via model transformation
|
||||
rules = load_rules(state,
|
||||
lambda rule_name, kind: f"{THIS_DIR}/rules/r_{rule_name}_{kind}.od",
|
||||
scd_mmm_ramified, ["create_top", "create_inheritance"])
|
||||
# Given a class diagram, extend it with a "Top"-type, i.e., an (abstract) supertype of all types. The set of instances of the "Top" is always the set of all objects in the diagram.
|
||||
def topify_cd(self, cd: UUID):
|
||||
with Timer("topify_cd"):
|
||||
# 1. Execute rule 'create_top' once
|
||||
rule = self.rules["create_top"]
|
||||
match_set = list(self.matcher_rewriter.match_rule(cd, rule.lhs, rule.nacs, "create_top"))
|
||||
if len(match_set) != 1:
|
||||
raise Exception(f"Expected rule 'create_top' to match only once, instead got {len(match_set)} matches")
|
||||
lhs_match = match_set[0]
|
||||
cd, rhs_match = self.matcher_rewriter.exec_rule(cd, rule.lhs, rule.rhs, lhs_match, "create_top")
|
||||
|
||||
# 1. Execute rule 'create_top' once
|
||||
rule = rules["create_top"]
|
||||
match_set = list(matcher_rewriter.match_rule(cd, rule.lhs, rule.nacs, "create_top"))
|
||||
if len(match_set) != 1:
|
||||
raise Exception(f"Expected rule 'create_top' to match only once, instead got {len(match_set)} matches")
|
||||
lhs_match = match_set[0]
|
||||
cd, rhs_match = matcher_rewriter.exec_rule(cd, rule.lhs, rule.rhs, lhs_match, "create_top")
|
||||
# 2. Execute rule 'create_inheritance' as many times as possible
|
||||
rule = self.rules["create_inheritance"]
|
||||
|
||||
# 2. Execute rule 'create_inheritance' as many times as possible
|
||||
rule = rules["create_inheritance"]
|
||||
while True:
|
||||
iterator = matcher_rewriter.match_rule(cd, rule.lhs, rule.nacs, "create_inheritance")
|
||||
# find first match, and re-start matching
|
||||
try:
|
||||
lhs_match = iterator.__next__() # may throw StopIteration
|
||||
cd, rhs_match = matcher_rewriter.exec_rule(cd, rule.lhs, rule.rhs, lhs_match, "create_inheritance")
|
||||
except StopIteration:
|
||||
break # no more matches
|
||||
# for match in self.matcher_rewriter.match_rule(cd, rule.lhs, rule.nacs, "create_inheritance"):
|
||||
# self.matcher_rewriter.exec_rule(cd, rule.lhs, rule.rhs, match, "create_inheritance", in_place=True)
|
||||
# render_od(self.state, cd, self.scd_mmm)
|
||||
|
||||
return cd
|
||||
while True:
|
||||
iterator = self.matcher_rewriter.match_rule(cd, rule.lhs, rule.nacs, "create_inheritance")
|
||||
# find first match, and re-start matching
|
||||
try:
|
||||
lhs_match = iterator.__next__() # may throw StopIteration
|
||||
cd, rhs_match = self.matcher_rewriter.exec_rule(cd, rule.lhs, rule.rhs, lhs_match, "create_inheritance")
|
||||
except StopIteration:
|
||||
break # no more matches
|
||||
return cd
|
||||
Loading…
Add table
Add a link
Reference in a new issue