| Reps, T. and Teitelbaum, T., The Synthesizer Generator: A system for constructing language-based editors, Springer-Verlag, New York, NY (1988). |
....may be annotated by one or more flags that control its properties and its interpretation by the runtime system. Once a lexeme has been produced, it is passed to a parser, Thus HARMONIA is not a template based monolingual framework as are the tools produced by the Synthesizer Generator [17], ASF SDF [21] and other similar systems. Name println . Name out . System Figure 1: This figure (a) illustrates a small syntax tree corresponding to (b) a fragment of the Java grammar for qualified names. This syntax tree represents the input System. out.println . a program ....
T. W. Reps and T. Teitelbaum. The Synthesizer Generator: A system for constructing language--based editors. Springer--Verlag, 1988.
....How to systematically discover and use such additional properties in general is a subject for future study. 7 Implementation and experimentation results All three steps caching, incrementalization, and pruning have been implemented in a prototype system, CACHET, using the Synthesizer Generator [53]. Incrementalization as currently implemented is semi automatic [29] and is being automated [63] Determining input increment operations and forming optimized programs are currently done manually, but both are straightforward for all the problems we have encountered. Figure 3 summarizes some of ....
T. Reps and T. Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York, 1988.
....example of that. 1. 1 Specifying compiler optimisations Several of the phases of a compiler can be generated from declarative speci cations: for instance, there are commonly used tools for syntax analysis (lex and yacc) for semantic analysis (attribute grammar systems such as FNC 2 and the SG [38, 56]) and also for instruction selection (IBURG [33] There is however no such widely accepted tool for the declarative speci cation of optimising transformations, although there have been many proposals, e.g. 4, 10, 17, 25, 31, 40, 43, 61 63] In a traditional compiler, the optimising ....
T. W. Reps and T. Teitelbaum. The Synthesizer Generator: A system for constructing language-based editors. Texts and Monographs in Computer Science. Springer-Verlag, 1989.
....mechanisms for attribute evaluation. We have, in fact, developed a simple prototype which uses the process described above to reduce a grammar with forwarding to a standard higher order attribute grammar written in SSL, the attribute grammar de nition language of the Synthesizer Generator [23]. This allows us to use this tool s analysis tests and attribute evaluation implementation. Attribute grammars are typically checked for de nedness in two phases. The rst phase, known as the closure test, checks that no semantic rules are missing. For example, if somewhere in the grammar the ....
T. W. Reps and T. Teitelbaum. The Synthesizer Generator: A system for constructing language-based editors. Texts and Monographs in Computer Science. Springer-Verlag, 1989.
....few years. All recent Pascal specifications are based on the ISO standard [ISO83] which is written in formal English but not in a formalism with mathematically defined semantics. Attribute grammar specifications are given for the synthesizer generator in the Synthesizer Specification Language [RT89] and for the GAG system in the ALADIN formalism [KHZ82] From these, just as from ASF SDF specifications, parsers, syntax directed editors, and type checkers can be derived. Both the attribute grammars and our algebraic specification take about 60 pages, but the ASF SDF specification seems to be ....
T. Reps and T. Teitelbaum. The Synthesizer Generator: a System for Constructing Language-Based Editors. Springer-Verlag, 1989.
....code displayed, and, secondly, in which way this is done. This problem is well known for the 2D case and solved by separating application data from their respective visualizations by means of model view controller strategies (c.f. KP88] In our case and similar to syntaxoriented editors (c.f. [RT88]) application data, and thus the model, is given by an abstract syntax graph of the Java code under consideration, and both the Java code itself and its 3dimensional visualization are views on this data. Whenever we talk about graphical manipulation of Java class relations we talk at the same ....
....requiring different strategies to handle them. Nevertheless, they are still harmless. With inconsistency, the user may construct arbitrary 3D models, resulting in arrangements impossible to automatically generate sensible and valid Java code. Hence we suggest, as for syntax oriented editors (c.f. [RT88]) to guide the user in such a way that inconsistent situations are eliminated as soon as possible during the manipulation process. The kind of guidance is left to an implementation. In analogy to 2D, we identified the move operation as some kind of an alien , switching its semantic level ....
Th. W. Reps and T. Teitelbaum. The synthesizer generator: a system for constructing language-based editors. Springer, 1988.
....integral topics in the area of domain specific languages. The first aims to provide formal descriptions of syntax and semantics, while the latter studies the e#cient tool generation from such formal specifications. ASF SDF [14] Centaur [10] Pan [9] PSG [8] CIGALE [25] and Synthesizer Generator [23] are examples of the many systems available. These typically provide language editing capabilities and e#cient language tool generation, including lexers and parsers, from language specifications similar to those of Phobos. Nevertheless, most do not allow for dynamic extension and integration but ....
Thomas W. Reps and Tim Teitelbaum. The Synthesizer Generator: a system for constructing language-based editors. Springer-Verlag New York, Inc., 1989.
....integral topics in the area of domain specific languages. The first aims to provide formal descriptions of syntax and semantics, while the latter studies the e#cient tool generation from such formal specifications. ASF SDF [12] Centaur [9] Pan [8] PSG [7] CIGALE [23] and Synthesizer Generator [21] are examples of the many systems available. These typically provide language editing capabilities and e#cient language tool generation, including lexers and parsers, from language specifications similar to those of Phobos. Nevertheless, most do not allow for dynamic extension and integration but ....
Thomas W. Reps and Tim Teitelbaum. The Synthesizer Generator: a system for constructing language-based editors. Springer-Verlag New York, Inc., 1989.
No context found.
Reps, T. and Teitelbaum, T., The Synthesizer Generator: A system for constructing language-based editors, Springer-Verlag, New York, NY (1988).
No context found.
Reps, T. and Teitelbaum, T., The Synthesizer Generator: A System for Constructing Language-Based Editors, Springer-Verlag, New York, NY (1988).
No context found.
Reps, T. and Teitelbaum, T., The Synthesizer Generator: A System for Constructing Language-Based Editors, Springer-Verlag, New York, NY (1988).
No context found.
Reps, T. and Teitelbaum, T., The Synthesizer Generator: A system for constructing language-based editors, Springer-Verlag, New York, NY (1988).
....where it is commonly known as finite differencing. However, general techniques of incremental computation have far broader application throughout software, e.g. loop optimizations in optimizing compilers [2, 3, 11, 14, 46] interactive systems like editors [6, 13, 43] and programming environments [5, 9, 13, 19, 24, 25, 41, 42], dynamic systems like distributed databases [10, 29] and real time systems [48] and image processing [49, 51, 53, 54] Incremental Computation. Given a program f and an input change operation Phi, a program f that computes the result of f(x Phi y) efficiently by making use of the value of ....
....results and auxiliary information is summarized in Section 1. Here, we take a closer look at related work in discovering auxiliary information for incremental computation. 12 Interactive systems and reactive systems often use various incremental algorithms to achieve fast response time [5, 6, 9, 13, 19, 24, 41, 42]. Explicit incremental algorithms are hard to write and appropriate auxiliary information is hard to discover. Our approach provides a general and systematic approach for developing particular incremental algorithms. For example, for the dynamic incremental attribute evaluation algorithm in [43] ....
T. Reps and T. Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York, 1988.
.... details of the integration algorithm, see [2] A preliminary implementation of a program integration tool that uses this technique has been embedded in a program editor created using the Synthesizer Generator, a meta system for creating interactive, language based program development systems [4]. Information maintained by the editor front end is used to construct dependence graphs. An integration command added to the editor invokes the integration algorithm on the dependence graphs, reports whether the variant programs interfere, and, if there is no interference, builds the integrated ....
Reps, T. and Teitelbaum, T., The Synthesizer Generator: A System for Constructing Language-Based Editors, Springer-Verlag, New York, NY (1988).
No context found.
Reps, T., Teitelbaum, T. The Synthesizer Generator: A System for Constructing Language-based Editors. SpringerVerlag, New York, 1988.
No context found.
Thomas W. Reps and Tim Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, 1989.
No context found.
Thomas W. Reps and Tim Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, 1989.
No context found.
T. W. Reps and T. Teitelbaum. The Synthesizer Generator: A system for constructing language--based editors. Springer--Verlag, 1988.
No context found.
Thomas W. Reps, and Tim Teitelbaum, The Synthesizer Generator: A system for constructing language based editors, Springer-Verlag, 1989.
No context found.
Thomas W. Reps and Tim Teitelbaum. The Synthesizer Generator: A System for Constructing Language-based Editors. Springer-Verlag, 1989.
No context found.
Reps, T. & Teitelbaum, T. (1988). The Synthesizer Generator: a system for constructing language based editors. Springer-Verlag. (third edition).
No context found.
Tom Reps and Tim Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, 1989.
No context found.
T. W. Reps and T. Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, New York, 1989.
No context found.
Reps T. W. and Teitelbaum T. The Synthesizer Generator: a system for constructing language-based editors. Texts and Monographs in Computer Science. Springer-Verlag, New York, USA, 1989.
No context found.
T. W. Reps and T. Teitelbaum. The Synthesizer Generator: A System for Constructing Language-Based Editors. SpringerVerlag, New York, 1989.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC