The syntax definition formalism SDF—reference manual—

Heering, Jan; Hendriks, Petra; Klint, Paul; Rekers, J.G.

doi:10.1145/71605.71607

Cited by 224 publications

(169 citation statements)

References 17 publications

Supporting

Mentioning

168

Contrasting

Unclassified

Order By: Relevance

“…An example of a grammar formalism that supports only limited composition is ANTLR [19]. In contrast, SDF2 [20] supports full context-free grammars based on a scannerless generalized LR parser, and composition support is much better: As an example, [21] demonstrates embedding SQL into Java. Disambiguation is necessary if the same syntactic form is used in the same location to represent different language concepts (i.e., must be parsed differently).…”

Section: Efficiently Entering (Textual) Codementioning

confidence: 99%

Towards User-Friendly Projectional Editors

Voelter¹,

Siegmund

Berger

et al. 2014

Software Language Engineering

View full text Add to dashboard Cite

Abstract. Today's challenges for language development include language extension and composition, as well as the use of diverse notations. A promising approach is projectional editing, a technique to directly manipulate the abstract syntax tree of a program, without relying on parsers. Its potential lies in the ability to combine diverse notational styles -such as text, symbols, tables, and graphics -and the support for a wide range of composition techniques. However, projectional editing is often perceived as problematic for developers. Expressed drawbacks include the unfamiliar editing experience and challenges in the integration with existing infrastructure. In this paper we investigate the usability of projectional editors. We systematically identify usability issues resulting from the architecture. We use JetBrains Meta Programming System (MPS) as a case study. The case study discusses the concepts that MPS incorporates to address the identified issues, evaluates effectiveness of these concepts by surveying professional developers, and reports industrial experiences from realizing large-scale systems. Our results show that the benefits of flexible language composition and diverse notations come at the cost of serious usability issues -which, however, can be effectively mitigated with facilities that emulate editing experience of parser-based editors.

show abstract

Section: Efficiently Entering (Textual) Codementioning

confidence: 99%

Towards User-Friendly Projectional Editors

Voelter¹,

Siegmund

Berger

et al. 2014

Software Language Engineering

View full text Add to dashboard Cite

show abstract

“…In the Strafunski architecture, we provide support for one specific syntax definition formalism, namely SDF [5]. This is a suitable candidate for extending the capabilities of an otherwise Haskell-centred architecture for language processing.…”

Section: External Componentsmentioning

confidence: 99%

“…The corresponding instances of a Term class can be generated using the DrIFT preprocessing technology [17]. The algebraic datatypes might be derived from XML schemas (or DTDs) and syntax definitions in SDF [5]; see the generators Sdf2Haskell and Dtd2Haskell. There are further Haskell libraries: XmlLib for XML document processing (contributed by HaXML [16]) and ATermLib for data interchange.…”

mentioning

confidence: 99%

A Strafunski Application Letter

Lämmel

Visser

2002

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c aA Strafunski Application Letter ABSTRACT Strafunski is a Haskell-centred software bundle for implementing language processing components -most notably program analyses and transformations. Typical application areas include program optimisation, refactoring, software metrics, software re-and reverse engineering. Strafunski started out as generic programming library complemented by generative tool support to address the concern of generic traversal over typed representations of parse trees in a scalable manner. Meanwhile, Strafunski also encompasses means of integrating external components such as parsers, pretty printers, and graph visualisation tools. In a selection of case studies, we demonstrate that typed functional programming in Haskell, augmented with Strafunski's support for generic traversal and external components, is very appropriate for the development of practical language processors. In particular, we discuss using Haskell for Cobol reverse engineering, Java code metrics, and Haskell re-engineering. Strafunski started out as generic programming library complemented by generative tool support to address the concern of generic traversal over typed representations of parse trees in a scalable manner. Meanwhile, Strafunski also encompasses means of integrating external components such as parsers, pretty printers, and graph visualisation tools.

show abstract

“…An application scenario for grammar refactoring is DeYACCification and modularisation which are useful in grammar reengineering in order to go from YACC-like pure BNF notation to a richer notation (cf. [15]) including constructs for extended BNF and modules as, for example, in SDF [8]. The steps to correct or to complete a grammar in grammar recovery can be modelled by constructing or destructing transformations.…”

Section: Integration With Transformationmentioning

confidence: 99%

Grammar Testing

Lämmel

2001

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Grammar testing is discussed in the context of grammar engineering (i.e., software engineering for grammars). We propose a generalisation of the known rule coverage for grammars, that is, contextdependent branch coverage. We investigate grammar testing, especially coverage analysis, test set generation, and integration of testing and grammar transformations. Grammar recovery is chosen as a subfield of grammar engineering to illustrate the developed concepts. Grammar recovery is concerned with the derivation of a language's grammar from some available resource such as a semi-formal language reference.

show abstract

The syntax definition formalism SDF—reference manual—

Cited by 224 publications

References 17 publications

Towards User-Friendly Projectional Editors

Towards User-Friendly Projectional Editors

A Strafunski Application Letter

Grammar Testing

Contact Info

Product

Resources

About