In this paper, we show how the OMG’s metamodelling approach to domain-specific language definition can be exploited to infer human-usable textual notations (concrete syntaxes) from the conceptualization provided by metamodels (abstract syntaxes). We give general rules to derive a context-free EBNF (Extended Backus-Naur Form) grammar from a MOF-compliant metamodel, and we show how to instruct a parser generator by these rules for generating a compiler which is able to parse the grammar and to transfer information about models into a MOF-based instance repository. The approach is exemplified for the Abstract State Machines Metamodel (AsmM), a metamodel for the Abstract State Machine (ASM) formal method, by illustrating the derivation of a textual notation to write ASM specifications conforming to the AsmM, and the process to input ASM models into a MOF repository.
Deriving a textual notation from a metamodel : an experience on bridging modelware and grammarware / A. Gargantini, E. Riccobene, P. Scandurra - In: Milestones, models and mappings for model-driven architecture : european workshop on milestones, models and mappings for model-driven architecture (3M4MDA) : Bilbao, Spain, july 11, 2006 : proceedings / [a cura di] João Paulo Andrade Almeida, Luís Ferreira Pires, Marten van Sinderen. - Enschede : University of Twente-Centre for telematics and information technology, 2006. - pp. 33-47 (( convegno European Workshop on Milestones, Models and Mappings for Model-Driven Architecture (3M4MDA) tenutosi a Bilbao nel 2006.
Deriving a textual notation from a metamodel : an experience on bridging modelware and grammarware
E. RiccobeneSecondo
;P. ScandurraUltimo
2006
Abstract
In this paper, we show how the OMG’s metamodelling approach to domain-specific language definition can be exploited to infer human-usable textual notations (concrete syntaxes) from the conceptualization provided by metamodels (abstract syntaxes). We give general rules to derive a context-free EBNF (Extended Backus-Naur Form) grammar from a MOF-compliant metamodel, and we show how to instruct a parser generator by these rules for generating a compiler which is able to parse the grammar and to transfer information about models into a MOF-based instance repository. The approach is exemplified for the Abstract State Machines Metamodel (AsmM), a metamodel for the Abstract State Machine (ASM) formal method, by illustrating the derivation of a textual notation to write ASM specifications conforming to the AsmM, and the process to input ASM models into a MOF repository.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.