scispace - formally typeset
Journal ArticleDOI

The Cornell program synthesizer: a syntax-directed programming environment

Tim Teitelbaum, +1 more
- 01 Sep 1981 - 
- Vol. 24, Iss: 9, pp 563-573
TLDR
The Cornell Program Synthesizer demands a structural perspective at all stages of program development and its separate features are unified by a common foundation: a grammar for the programming language.
Abstract
Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program Synthesizer demands a structural perspective at all stages of program development. Its separate features are unified by a common foundation: a grammar for the programming language. Its full-screen derivation-tree editor and syntax-directed diagnostic interpreter combine to make the Synthesizer a powerful and responsive interactive programming tool.

read more

Citations
More filters
Journal ArticleDOI

The synthesizer generator

TL;DR: A program editor can use knowledge of such relationships to detect and provide immediate and effective solutions as mentioned in this paper. But it is not a complete list of all the relationships that can be found in a program.
Journal ArticleDOI

Granularity issues in a knowledge-based programming environment

TL;DR: This paper describes the many alternative granularities and explains the choices made for Marvel, a knowledge-based programming environment that assists software development teams in performing and coordinating their activities.
Journal ArticleDOI

Re-structuring the programmer's task

TL;DR: This paper analyses the Smalltalk/V environment with respect to these programming tasks and develops a redesign in which code components can be borrowed and manipulated under the task-oriented rubric of projects.
Book ChapterDOI

The VORTEX document preparation environment

TL;DR: The approach is to derive an internal representation based on which transformations between source and target can be realized efficiently and the basic functionalities and user interface are presented.

A systematic approach to advanced debugging through incremental compilation (Preliminary Draft)

TL;DR: This paper presents two topics: implementation of a debugger through use of an incremental compiler, and techniques for fine-grained incremental compilation.
References
More filters
Proceedings ArticleDOI

Closest-point problems

TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
Journal ArticleDOI

Algorithms for Reporting and Counting Geometric Intersections

TL;DR: Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
Proceedings ArticleDOI

A research center for augmenting human intellect

TL;DR: In this article, a multisponsor research center at Stanford Research Institute in man-computer interaction is described, where the authors describe a multiscale multi-modal system.
Proceedings ArticleDOI

Geometric intersection problems

TL;DR: An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.
Journal ArticleDOI

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

TL;DR: This paper investigates the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane and describes an algorithm that solves this problem in worst case time proportional to n lg n + k, where k is the number of interesecting pairs found.