作者: V. Štuikys , K. Bespalova , R. Burbaitė
DOI: 10.5755/J01.ITC.43.1.3715
关键词:
摘要: The paper presents: (1) a graph-based theoretical background to refactoring correct heterogeneous meta-program into its k-stage representation; (2) the method; (3) experiments with tasks taken from different domains, including real world tasks, such as meta-programs teach Computer Science (CS) topics using educational robots. Refactoring by staging enables flexibly adapt them context of use. To do that (semi-)automatically, we use contextual information priority relation (e.g. highest, lowest, etc.) introduced within specification. We implement method so-called activating/de-activating label (index) change role meta-language constructs at stages. contribution is: applying known (in programming) concept meta-programming; background, properties and solve this kind refactoring. DOI: http://dx.doi.org/10.5755/j01.itc.43.1.3715