Welcome to the InfoSci Platform
Abstraction of Computer Language Patterns: The Inference of Textual Notation for a DSL

Abstraction of Computer Language Patterns: The Inference of Textual Notation for a DSL

Jaroslav Porubän, Ján Kollár, Miroslav Sabo
Copyright: © 2013 |Pages: 21
ISBN13: 9781466620926|ISBN10: 1466620927|EISBN13: 9781466620933
DOI: 10.4018/978-1-4666-2092-6.ch013
Cite Chapter Cite Chapter

MLA

Porubän, Jaroslav, et al. "Abstraction of Computer Language Patterns: The Inference of Textual Notation for a DSL." Formal and Practical Aspects of Domain-Specific Languages: Recent Developments, edited by Marjan Mernik, IGI Global, 2013, pp. 365-385. https://doi.org/10.4018/978-1-4666-2092-6.ch013

APA

Porubän, J., Kollár, J., & Sabo, M. (2013). Abstraction of Computer Language Patterns: The Inference of Textual Notation for a DSL. In M. Mernik (Ed.), Formal and Practical Aspects of Domain-Specific Languages: Recent Developments (pp. 365-385). IGI Global. https://doi.org/10.4018/978-1-4666-2092-6.ch013

Chicago

Porubän, Jaroslav, Ján Kollár, and Miroslav Sabo. "Abstraction of Computer Language Patterns: The Inference of Textual Notation for a DSL." In Formal and Practical Aspects of Domain-Specific Languages: Recent Developments, edited by Marjan Mernik, 365-385. Hershey, PA: IGI Global, 2013. https://doi.org/10.4018/978-1-4666-2092-6.ch013

Export Reference

Mendeley
Favorite

Abstract

In general, designing a domain-specific language (DSL) is a complicated process, requiring the cooperation of experts from both application domain and computer language development areas. One of the problems that may occur is a communication gap between a domain expert and a language engineer. Since domain experts are usually non-technical people, it might be difficult for them to express requirements on a DSL notation in a technical manner. Another compelling problem is that even though the majority of DSLs share the same notation style for representing the common language constructs, a language engineer has to formulate the specification for these constructs repeatedly for each new DSL being designed. The authors propose an innovative concept of computer language patterns to capture the well-known recurring notation style often seen in many computer languages. To address the communication problem, they aim for the way of proposing a DSL notation by providing program examples as they would have been written in a desired DSL. As a combination of these two ideas, the chapter presents a method for example-driven DSL notation specification (EDNS), which utilizes computer language patterns for semi-automated inference of a DSL notation specification from the provided program examples.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.