(Enter summary)
Abstract: The design and implementation of the language fSDL (full Structure Definition Language) is discussed. In
fSDL, complex user-defined data types such as lists, tables, trees, and graphs can be constructed from a
tiny set of primitives. Beyond mere structure definitions (also offered by previously existing tools) high-level
functionality on these data types can be specified. In the COMPARE (ESPRIT) project, the C code generated
from an fSDL specification will be used by compiler-components... (Update)
Context of citations to this paper: More
...data description language fSDL. It provides graph and set functors (template classes) From this a uniform access interface is generated [WKD94]. All hand written and generated phases use this interface so that a uniform data access is given. 3 Designing the data model Before...
.... ASF SDF specification exists, such as PASCAL, CLaX [DT92] the box language itself, simplified LISP code, Action Semantics [Mos92] fSDL [WKD93] COBOL, C, and the definition part of the generated prettyprinters. The generator is compiled using the ASF2C compiler [KW93] to...
Cited by: More
Graph Rewrite Systems For Program Optimization - Aßmann (1996)
(Correct)
Software Cocktail Bars - A Model For Extensible Software - Aßmann (1996)
(Correct)
Generation of Language Independent Modular Prettyprinters - van den Brand (1993)
(Correct)
Similar documents (at the sentence level):
8.2%: A trying C++ experience (why compare dropped C++) - Dinesh
(Correct)
Active bibliography (related documents): More All
0.2: Analyse Statique Comportementale des Langages de Programmation. - Jouvelot
(Correct)
0.2: PIPS: a Workbench for Building Interprocedural.. - Keryell, Ancourt, .. (1996)
(Correct)
0.2: How to Add a New Phase in PIPS: the Case of Dead Code.. - Corinne Ancourt (1996)
(Correct)
Similar documents based on text: More All
0.8: An Asymptotic Analysis of Closed Queueing Networks With .. - Bayer, Coffman, Jr..
(Correct)
0.8: Why Combine Logics? - Blackburn, de Rijke (1995)
(Correct)
0.7: Modal Model Theory - de Rijke
(Correct)
Related documents from co-citation: More All
2: On Edge Addition Rewrite Systems and Their Relevance to Program Analysis
- ABetamann - 1995
2: Cosy Compiler Phase Embedding with the Cosy Compiler Model
- Alt, ABetamann et al. - 1994
2: Generierung von Programmoptimierungen mit Graphersetzungssystemen (context) - ABetamann - 1995
BibTeX entry: (Update)
H.R. Walters, J.F.Th. Kamperman, and T.B. Dinesh. An extensible language for the generation of parallel data manipulation and control packages. In P. Fritzson, editor, Proceedings of the Poster Session of Compiler Construction, number LiTH-IDA-R-94-11 in PELAB Research Report. Linkoping University, 1994. http://citeseer.ist.psu.edu/walters94extensible.html More
@incollection{ walters95extensible,
author = "H. R. Walters and Jasper F. Th. Kamperman and T. B. Dinesh",
title = "An extensible language for the generation of parallel data manipulation and control packages",
booktitle = "92",
month = "31",
publisher = "Centrum voor Wiskunde en Informatica (CWI)",
address = "ISSN 0169-118X",
pages = "16",
year = "1995",
url = "citeseer.ist.psu.edu/walters94extensible.html" }
Citations (may not include all citations):
476
Programming Language (context) - Kernighan, Ritchie - 1978
86
Gandalf: software development environments (context) - Habermann, Notkin - 1986
46
Coarse-Grain Parallel Programming in Jade
- Lam, Rinard - 1991
12
Ast -- a generator for abstract syntax trees (context) - Grosch - 1990
4
NewGen: A language-independent program generator (context) - Jouvelot, Triolet - 1989
1
The virtual tree processor (context) - Cl'ement, Incerpi et al. - 1989
1
ACM Symposium on Principles of Programming Languages (context) - Lucassen, Gifford et al. - 1988
1
Esprit project Compare delivarable D1 (context) - Consortium, CoSy - 1992
1
Principles of Computer science series (context) - Snodgrass, description et al. - 1989
1
A library of functors in fSDL: Reference Manual (context) - Thomasset - 1993
Documents on the same site (http://info4u.cwi.nl/static/publications/reports/CS-1995.html): More
Ntyft/ntyxt Rules Reduce to Ntree Rules - Fokkink, van Glabbeek (1996)
(Correct)
Equational Term Graph Rewriting - Ariola, Klop (1993)
(Correct)
Raising GA Performance by Simultaneous Tuning of.. - van Kemenade, Kok, Eiben (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC