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
Patent
Bandwidth reduction of multichannel images for machine vision
TL;DR: In this paper, a multichannel training image representing a training scene is acquired and the weighting factors for the respective channels are determined based on the contrast at corresponding locations in the training image.
Journal ArticleDOI
From information system requirements to designs: a mapping framework
Lawrence Chung,Panagiotis Katalagarianos,Manolis Marakakis,Michalis Mertikas,John Mylopoulos,Yannis Vassiliou +5 more
TL;DR: The paper includes the description of a prototype implementation of aspects of the proposed mapping framework and illustrates its features through a sample session and the implementation was carried out within the DAIDA project at the Institute of Computer Science of the Foundation for Research and Technology, Crete.
Gaining design insight through interaction prototyping tools
TL;DR: A set of methods, embodied in authoring tools, that lower the expertise threshold required to author such novel interfaces, enable more designers to author a wider range of interfaces, faster.
Journal ArticleDOI
Cognition-sensitive design and user modeling for syntax-directed editors
TL;DR: Results are presented which show that cognitive styles vary over a significant spectrum and that their consideration in the design of a syntax-directed editor will result in an intelligent tool that will be right for the cognitive skills and expertise of an individual user.
Incremental Semantic Analysis
TL;DR: The main contribution of this work is a new technique for developing incremental semantic analyzers: Door Attribute Grammars, which extends standard attribute grammars by allowing objects and references to be specified as part of the attribution of a syntax tree.
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.