Ellis Cohen
Skip Abstract Section
Abstract
The main problems associated with program structure editors are not inherent and can be solved without reverting to a textual viewpoint. Cursor movements can be made more natural by viewing the screen as a 2-D arrangement of nodes. Expressions can be input from left to right by rebinding operator keys to commands more complex than simple template expansion. Transformations of program fragments can be accomplished by an editor which supports matching and instantiation of subtrees.
- V. Donzeau-Gouge et. al., "A Structure-Oriented Program Editor", Tech. Report, IRIA-LABORIA, France 1975Google Scholar
- C. Ghezzi & D. Mandrioli, "Augmenting Parsers to Support Incrementality", JACM 27, 3 (July 1980) Google ScholarDigital Library
- J. Gosling, "Unix Emacs", Computer Science Dept., Carnegie-Mellon Univ., Pittsburgh PA, December 1981Google Scholar
- C. Hoffman & M. O'Donell, "Pattern Matching in Trees", JACM 29, 1 (Jan 1982) Google ScholarDigital Library
- R. Medina-More & P. Feiler, "An Incremental Programming Environment", IEEE Transactions on Software Engineering 7, 5 (Sept 81) Google ScholarDigital Library
- M. Rudell, "MYTE: An Extensible Program Structure Editor", Tech. Report CS-82-104, Computer Science Program, Brandeis University, Waltham MA, May 1982Google Scholar
- R. Stallman, "EMACS Manual for TWENEX Users", AI Memo 555, AI Laboratory, MIT, Oct 1981Google Scholar
- T. Teitelbaum & T. Reps, "The Cornell Program Synthesizer: A Syntax-Directed Programming Environment", CACM 24, 9 (Sept 81) Google ScholarDigital Library
- R. Waters, "Program Editors Should Not Abandon Text Oriented Commands", SIGPLAN Notices 17, 7 (July 82) Google ScholarDigital Library
- M. Wegman, "Parsing for a Structural Editors", 21st Annual Foundations of Computer Science, Oct 1980Google Scholar
- M. Wegman, "Parsing for a Structural Editor (Part II)", IBM Watson Research Center, 1981Google Scholar
Recommendations
The affix array data structure and its applications to RNA secondary structure analysis
Efficient string-processing in large data sets like complete genomes is strongly connected to the suffix tree and similar index data structures. With respect to complex structural string analysis like the search for RNA secondary structure patterns, ...
Comments