IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

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
View Sample PDF
Author(s): Jaroslav Porubän (Technical University of Košice, Slovakia), Ján Kollár (Technical University of Košice, Slovakia)and Miroslav Sabo (Technical University of Košice, Slovakia)
Copyright: 2014
Pages: 21
Source title: Computational Linguistics: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-4666-6042-7.ch069

Purchase

View Abstraction of Computer Language Patterns: The Inference of Textual Notation for a DSL on the publisher's website for pricing and purchasing information.

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.

Related Content

Reinaldo Padilha França, Ana Carolina Borges Monteiro, Rangel Arthur, Yuzo Iano. © 2021. 21 pages.
Abdul Kader Saiod, Darelle van Greunen. © 2021. 28 pages.
Aswini R., Padmapriya N.. © 2021. 22 pages.
Zubeida Khan, C. Maria Keet. © 2021. 21 pages.
Neha Gupta, Rashmi Agrawal. © 2021. 20 pages.
Kamalendu Pal. © 2021. 14 pages.
Joy Nkechinyere Olawuyi, Bernard Ijesunor Akhigbe, Babajide Samuel Afolabi, Attoh Okine. © 2021. 19 pages.
Body Bottom