Efficient abstractions for the implementation of structured editors

Authors:
Robert Hood
Affiliations:
Department of Computer Science, Rice University, Houston, Texas
Venue:
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Year:
1985

Citing 8
Cited 2

The C programming language

The C programming language
The Cornell program synthesizer: a syntax-directed programming environment

Communications of the ACM
Anatomy of LISP

Anatomy of LISP
Paths: an abstract alternative to pointers

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A proposal for standard ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
A constructive alternative to axiomatic data type definitions

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
HOPE: An experimental applicative language

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
The efficient implementation of very-high-level programming language constructs

The efficient implementation of very-high-level programming language constructs

Syntax-directed editing environments: issues and features

SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
AML: attribute grammars in ML

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the use of abstract recursive data structures and operations in the implementation of a structured program editor. The value-oriented semantics of the proposed constructs simplify the implementation of important features such as version control and an unbounded undo operation. Since the constructs can be implemented efficiently, their use in the structured program editor does not significantly affect its performance.