The Synthesizer Generator Reference Manual

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The Synthesizer Generator is a system for automating the implementation of language-based editing environments. The editor designer prepares a specification that includes rules defining a language's context-free abstract syn­ tax, context-sensitive relationships, display format, and concrete input syntax. From this specification, the Synthesizer Generator creates a display editor for manipulating objects according to these rules [Reps84]. This volume, The Synthesizer Generator Reference Manual, is intended as the defining document of the system. A companion volume, The Synthesizer Gen­ erator: A System for Constructing Language-Based Editors [Reps88], provides a more tutorial description of the system; it contains numerous examples that illustrate the specification and use of generated editors, as well as chapters that explain important algorithms of the implementation. The Synthesizer Generator is a generalization of our earlier system, the Cor­ nell Program Synthesizer [Teitelbaum81], which was a programming environ­ ment for a specific small dialect of PL/I. It featured a display-oriented, syntax­ directed editor, an incremental compiler, an execution supervisor supporting source-level debugging, and a file system containing syntactically typed pro­ gram fragments. Whereas PL/I was built into the Cornell Program Synthesizer, the Synthesizer Generator accepts a formal language definition as input. Although originally conceived as a tool for creating Synthesizer-like environments for arbitrary pro­ gramming languages, the Synthesizer Generator is more broadly useful. Any textual language with a hierarchical phrase structure grammar is a candidate. vi Preface Interactive theorem proving for formal mathematics and logic, for example, has emerged as a particularly suitable application.

Author(s): Thomas W. Reps, Tim Teitelbaum
Series: Texts and Monographs in Computer Science
Edition: 3rd
Publisher: Springer
Year: 1989

Language: English
Pages: 183
Tags: Software Engineering; Programming Techniques

Front Matter....Pages i-xi
Introduction....Pages 1-5
Specifying an Editor....Pages 6-89
Using an Editor....Pages 90-111
The SSL Debugger....Pages 112-114
Interface to C....Pages 115-128
Back Matter....Pages 129-175