Paper Grammars As Contracts

This paper is available in ps and pdf.

Abstract

Component-based development of language tools stands in need of meta-tool support. This support can be offered by generation of code -- libraries or full-fledged components -- from syntax definitions. We develop a comprehensive architecture for such syntax-driven meta-tooling in which grammars serve as contracts between components. This architecture addresses exchange and processing both of full parse trees and of abstract syntax trees, and it caters for the integration of generated parse and pretty-print components with tree processing components.

We discuss an instantiation of the architecture for the syntax definition formalism SDF, integrating both existing and newly developed meta-tools that support SDF. The ATerm format is adopted as exchange format. This instantiation gives special attention to adaptability, scalability, reusability, and maintainability issues surrounding language tool development.

BibTeX entry

@INPROCEEDINGS{
  JV2000,
  author =      "de Jonge, M. and J. Visser",
  title  =      {Grammars as Contracts},
  booktitle =   {Generative and Component-Based Software Engineering, Second
                 International Symposion, GCSE 2000},
  address =     "Erfurt, Germany",
  year =        "2001",
  month =       oct,
  series =      "Lecture Notes in Computer Science",
  volume =      "2177",
  publisher =   "Springer",
  editor =      "Greg Butler and Stan Jarzabek",
  pages  =      "85--99",
  url       = base_url # "PaperGrammarsAsContracts"
}

CategoryPapers

-- MerijnDeJonge - 06 Apr 2003