Abstract syntax graphs for domain specific languages

Domain Specific Languages (DSLs) are often defined in terms of metamodels capturing the abstract syntax of the language. For a complete definition of a DSL, both syntactic and semantic aspects of the language have to be specified. Metamodeling environments support syntactic definition issues, but they do not provide any help in defining the semantics of metamodels, which is usually given in natural language. In this chapter, the authors present an approach to formally define the semantics of metamodel-based languages. It is based on a translational technique that hooks to the language metamodel its precise and executable semantics expressed in terms of the Abstract State Machine formal method. The chapter also shows how different techniques can be used for formal analysis of models (i.e., instance of the language metamodel). The authors exemplify the use of their approach on a language for Petri nets.

Download Full-text

Abstract syntax driven approach for language composition

Open Computer Science ◽

10.2478/s13537-014-0211-8 ◽

2014 ◽

Vol 4 (3) ◽

Cited By ~ 4

Author(s):

Sergej Chodarev ◽

Dominik Lakatoš ◽

Jaroslav Porubän ◽

Ján Kollár

Keyword(s):

Abstract Syntax ◽

Domain Specific Languages ◽

Incremental Development ◽

Domain Specific ◽

Concrete Syntax ◽

Object Composition ◽

Parser Generator

AbstractPopularity of domain-specific languages brings the problem of language components reuse. It should be possible to use parts of different languages in development of new one to lower costs and also allow incremental development. This problem could be solved using the composition of languages. In this paper we discuss the view of language composition from the perspective of concepts composition, where the role of concrete syntax is lowered. We present examples of language composition based on the principles of object composition implemented using YAJCo parser generator, that allows to specify the language based on its abstract syntax.

Download Full-text

Operator Overloading as a DSL Parsing Mechanism

Advances in Computer and Electrical Engineering - Code Generation, Analysis Tools, and Testing for Quality ◽

10.4018/978-1-5225-7455-2.ch008 ◽

2019 ◽

pp. 179-190

Author(s):

Alberto Simões ◽

Rui Miguel da Costa Meira

Keyword(s):

Linear Algebra ◽

Domain Specific Language ◽

Abstract Syntax ◽

Domain Specific Languages ◽

Specific Language ◽

Domain Specific ◽

Run Time ◽

The Creation ◽

Abstract Syntax Trees ◽

Syntax Trees

This chapter describes an approach for the implementation of embedded domain-specific languages by using operator overloads and the creation of abstract syntax trees in run-time. Using the host language parser, an AST is created stating the structure of the DSL expression that is later analyzed, simplified, and optimized before the evaluation step. For the illustration of this process, the chapter proposes a domain-specific language for a basic linear algebra system dealing with matrices algebra and its optimization.

Download Full-text

Formal Semantics for Metamodel-Based Domain Specific Languages

Formal and Practical Aspects of Domain-Specific Languages ◽

10.4018/978-1-4666-2092-6.ch008 ◽

2012 ◽

pp. 216-241

Author(s):

Paolo Arcaini ◽

Angelo Gargantini ◽

Elvinia Riccobene ◽

Patrizia Scandurra

Keyword(s):

Natural Language ◽

Formal Method ◽

Formal Analysis ◽

Formal Semantics ◽

State Machine ◽

Abstract Syntax ◽

Domain Specific Languages ◽

Abstract State Machine ◽

Domain Specific ◽

Definition Of

Domain Specific Languages (DSLs) are often defined in terms of metamodels capturing the abstract syntax of the language. For a complete definition of a DSL, both syntactic and semantic aspects of the language have to be specified. Metamodeling environments support syntactic definition issues, but they do not provide any help in defining the semantics of metamodels, which is usually given in natural language. In this chapter, the authors present an approach to formally define the semantics of metamodel-based languages. It is based on a translational technique that hooks to the language metamodel its precise and executable semantics expressed in terms of the Abstract State Machine formal method. The chapter also shows how different techniques can be used for formal analysis of models (i.e., instance of the language metamodel). The authors exemplify the use of their approach on a language for Petri nets.

Download Full-text