Journal ArticleDOI
The Cornell program synthesizer: a syntax-directed programming environment
Tim Teitelbaum,Thomas Reps +1 more
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
Providing customized assistance for software lifecycle approaches
J. Ramanthan,S. Sarkar +1 more
TL;DR: A tightly coupled environment architecture centered around a customized software development assistant, that uses underlying representations of the software development process, the objects and relationships being manipulated, the functionalities of the tools, and the roles of the various project members to provide automated support for this discipline.
Journal ArticleDOI
A system for generating language-oriented editors
TL;DR: The authors present a system for generating language-oriented editors based on object-oriented concepts that generates a flexible and easily extendable language- oriented editor from a target language description in a highly modularized fashion.
Patent
Language-sensitive whitespace adjustment in a software engineering tool
TL;DR: In this paper, the amount of whitespace between any two adjacent tokens is determined according to language-specific style rules and scaled in accordance with display considerations, and the operative scaling relates to requirements or constraints of an automated layout mechanism.
Patent
Method and system for generating and displaying a computer program
TL;DR: In this paper, a program tree editor is presented for directly manipulating program trees, which are composed of plurality of nodes corresponding to computational constructs, and a display representation generator is used to retrieve nodes from the program tree and display a representation of the node.
Dissertation
On the construction of persistent programming environments
TL;DR: Much of the thesis is concerned with the design and implementation of persistent programming languages, in particular PS-algol and Napier, and the construction of compilers in a persistent environment, which introduces a new software architecture that permits adaptive programs to be constructed incrementally.
References
More filters
Proceedings ArticleDOI
Closest-point problems
Michael Ian Shamos,Dan Hoey +1 more
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
Michael Ian Shamos,Dan Hoey +1 more
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.