T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. Trans. on Prog. Lang. and Syst., 5(3):449-477, July 1983.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....trees in which, every time an item is inserted or deleted, a new version of the tree is created. These trees are called persistent because they allow accesses to all previous versions of the tree. The simplest method of implementing persistent augmented binary search trees is by path copying [5, 7, 8, 9, 11]. This results 7 . B i # 1 B j # # T i # ,i # T j # ,j A i # ,j # Figure 4: The median of a i , a j can be computed from two persistent search trees. in O(log n) new nodes being created each time an element is inserted or deleted, so a sequence of n update operations creates a ....

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5:449--477, 1983.

....they either handle specific problems for particular input changes in the programs, or at the other end propose too general frameworks. Even though, some specific techniques and frameworks have helped in the design choices we have made for incXSLT. For example, selective recomputation used also in [17] helped in the identification of the rule fragments responsible for the modifications between source and target elements. The second technique is based on performance optimization based on intermediate result caching [10] In our case, we reused this notion of local caches to allow execution state ....

T. Reps, T. Teitelbaum and A. Demers, "Incremental context-dependent analysis for language-based editors", ACM Trans. Program. Languages System, vol. 5, num 3, pp. 449-477, July 1983.

....that every structure created is automatically fully persistent (accessible and modifiable) Persistent data structures arise not only in functional programming but also in text, program, and file editing and maintenance; computational geometry; and other algorithmic application areas. See [6, 9, 11, 10, 13, 12, 14, 15, 18, 24, 25, 26, 27, 28, 29, 30]. Several papers have dealt with the problem of adding persistence to general data structures in a way that is more efficient than the obvious solution of copying the entire structure whenever a change is made. In particular, Driscoll, Sarnak, Sleator, and Tarjan [13] described how to make ....

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language based editors. ACM Transactions on Programming Languages and Systems, 5:449--477, 1983.

....or program transformation system. The prototype, including the dynamic transformations, was written as a pure attribute grammar. I Introduction This paper describes a prototype program transformation system made in four man months with the attribute grmmox based Synthesizer Generator (sa) RTD 83] The prototype transformation system (the BMF editor) supports the interactive derivation of equational algorithm proofs in the Bird Meertens formalism (BMF) Bird 87, MRT 86] Doing a derivation in BMF means repeatedly applying transformations to BMF formulas. This is a copy of the manuscript ....

Reps, T., T. Teitelbaum and A. Demers. Incremental Context-Dependent Anal- ysis for Language Based Editors. In ACM Transactions on Progr. Lang. and Systems, Vol. 5, No. 3, pages 449-477, July 1983.

....6.2 Conventional techniques Below several incremental AG evaluators will be listed. All of them can be trivially adapted for the higher oder case but none of them is capable of efficiently handling multiple instantiations of the same NTA and reusing slightly modified NTAs. OAG [Kastens 80, Reps, Teitelbaum and Demers 83] Optimal time change propagation [Reps, Teitelbaum and Demers 83] Approximate Topological Ordering [Hoover 86] Function caching [Pugh 88] The following observations hold for all of the above mentioned incremental evaluators: Attributes axe stored in the tree. The tree functions as a ....

....will be listed. All of them can be trivially adapted for the higher oder case but none of them is capable of efficiently handling multiple instantiations of the same NTA and reusing slightly modified NTAs. OAG [Kastens 80, Reps, Teitelbaum and Demers 83] Optimal time change propagation [Reps, Teitelbaum and Demers 83] Approximate Topological Ordering [Hoover 86] Function caching [Pugh 88] The following observations hold for all of the above mentioned incremental evaluators: Attributes axe stored in the tree. The tree functions as a cache for the semantic functions during incremental evaluation. Equal ....

Reps, T. , T. Teitelbaum and A. Demers. Incremental Context-Dependent Analysis for Language Based Editors. In ACM Transactions on Progr. Lang. and Systems, Vol. 5, No. 3, pages 449-477, July 1983.

....efficient algoritlun for attribute evaluation can be derived. 1 Introduction For quite some time now attribute grammars (AGs) are used in the field of compiler construction. The GAG system, described in [Kasts, Hurt and Zimmetuan 81] and the Synthesizer Generator, described in [Reps 1982] and [Reps, Teitelbuum and Demers 1983], are typical amples. The term compilation is mostly used to denote the conversion of an algoritlun expressed in a human oriented source language to an equivalent algorithm expressed in a hardware.orionted target language. A compilation is usu. ally implememed as a sequence of Uunsfmmatlons (SL, ....

T. Peps, T. Teitelbaum and A. Demers. Incremental Context-Dependent Analysis for Language Based Editors. In ACM Trans- actions on Progr. Lang. and Systems, VoL 5, No. 3, pages 449-477, July 1983.

....old parts is automatically removed. Attributes in the new subtrees must be evaluated, as well as the attributes whose value depends on the values of the new attributes. This method is coarse grain because the re computation of an individual attribute value is not incremental. Reps et al. Rep82, RTD83] describe incremental attribute update algorithms based on this way of storing and updating intermediate results. The strategy is implemented in the Synthesizer Generator [RT89a, RT89b] Extended Affix Grammars Extended affix grammars [Kos91] are a language specification formalism closely ....

....by PROPAGATE TE UP, and during reduction. As a result, the number of re evaluated attributes is O(jAffected j jpaths to root j) A previous approach Reps, Teitelbaum and Demers have described an optimal time algorithm for updating attribute values in the context of attribute grammars [RTD83] An earlier approach for incremental rewriting [Meu92] was patterned after this algorithm. In short: after each edit action, re evaluation starts at the point of subtree replacement. When a synthesized attribute at the top of the new subtree has corresponding inherited attributes, that could ....

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449--477, 1983.

....persistent data structure and produces a tree like history of the data structure: each new version descends from an arbitrary older one. There has been much previous work on making various data structures partially or fully persistent [CG93, Cha85, Col86, DM85, HM81, Mye82, Mye83, Mye84, Ove81a, RTD83, ST86] There have also been some results providing general methods for making entire classes of data structures persistent [Die89, DR91, DSST89, Ove81b, Sar86] In particular, Driscoll et al. DSST89] provide a method by which many pointer based data structures may be made partially or fully ....

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449--77, 1983.

....data structures for other abstract data types besides authenticated dictionaries. The idea of path copying in a tree, for example, which is a component in some of our solutions, has been used in non authenticated contexts by several researchers (e.g. Myers [14] and Reps, Teitelbaum and Demers [17]) Sarnak and Tarjan [18] proposed the node copying method and use persistent trees to solve the planar point location problem, while Driscoll, Sarnak, Sleator and Tarjan [4] developed techniques for making linked data structures persistent. Nevertheless, none of these previous schemes for making ....

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449--477, July 1983.

....where AFFECTED is the set of attribute instances whose values differ before and after re evaluation. This performance criterion is nearly universally cited as the goal to which an incremental attribute evaluator should aspire, and is termed (asymptotic) optimal time by Reps, Teitelbaum, and Demers [66]. Algorithms that achieve this complexity generally do so by assuring that an attribute is evaluated only after its predecessors have achieved their correct final values, 52 i.e. change propagation respects a topological ordering with respect to the attribute dependency graph. Failure to observe ....

....applied after multiple subtree replacements have taken place, will propagate changes from each replacement site independently. Should the affected regions of the tree intersect, the topological ordering constraint may be violated, and the affected regions may have to be re evaluated. Reps et al. [66] show that naive change propagation can be exponential in jAFFECTEDj for a depth first traversal of the dependency graph, and quadratic if a breadth first traversal is used. Good performance in the general case requires that change propagation originating from multiple initial sites of attribute ....

[Article contains additional citation context not shown here]

Thomas Reps, Tim Teitelbaum, and Alan Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449-- 477, July 1983.

....they either handle specific problems for particular input changes in the programs, or at the other end propose too general frameworks. Even though, some specific techniques and frameworks have helped in the design choices we have made for iXSLT. For example, selective re computation used also in [17] helped in the identification of the rule fragments responsible for the modifications between source and target elements. The second technique is based on performance optimization based on intermediate result caching [10] In our case, we reused this notion of local caches to allow execution state ....

T. Reps, T. Teitelbaum and A. Demers, "Incremental context-dependent analysis for language-based editors", ACM Trans. Program. Languages System, vol. 5, num 3, pp. 449-477, July 1983.

....goals have succeeded. Like in unrestricted attribute grammars, circularities among the goals in an LCG description can arise. It is left to the writer of an LCG description to remedy circularities. Other well known speci cation formalisms for language implementation include attribute grammars [18, 54], action routines [37, 46] context relations [5] and natural semantics [35] Attribute grammars provide a declarative mechanism for de ning attribute (property) values at subtrees in a syntax tree. An attribute value at a subtree is a function of the attribute values de ned at neighboring ....

Reps, T., Teitelbaum, T., and Demers, A. Incremental context dependent analysis for language based editors. ACM Trans. on Programming Languages and Systems 5, 3 (July 1983), 449-477.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. Trans. on Prog. Lang. and Syst., 5(3):449-477, July 1983.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. Trans. on Prog. Lang. and Syst., 5(3):449--477, July 1983.

No context found.

Reps, T., Teitelbaum, T., and Demers, A., "Incremental context-dependent analysis for language-based editors," ACM Trans. Program. Lang. Syst. 5(3) pp. 449-477 (July 1983).

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. Trans. on Prog. Lang. and Syst., 5(3):449--477, July 1983.

....literature [7, 12, 35, 37, 45] 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 ....

....results used in computing the output f(x) also need to be maintained for efficient incremental computation of f(x Phi y) Moreover, certain auxiliary information about x may need to be discovered and maintained as well. Numerous techniques for incremental computation have been developed, e.g. [3, 4, 16, 20, 21, 24, 31, 36, 38, 40, 43, 44, 47, 52]. In [31] we give a systematic transformational approach for deriving an incremental program f from a given program f and an input change Phi. The basic idea is to identify in the computation of f(x Phi y) those subcomputations that are also performed in the computation of f(x) and whose ....

[Article contains additional citation context not shown here]

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449--477, July 1983.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. "Incremental Context-Dependent Analysis for LanguageBased Editors". ACM TOPLAS 5, 3 (July 1983), 449-477.

No context found.

Thomas W. Reps, Tim Teitelbaum, and Alan Demers, "Incremental Context-Dependent Analysis for Language-Based Editors", ACM Transactions on Programming Languages and Systems, Vol. 5, No. 3, July 1983, pp. 449-477.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental contextdependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5(3):449-- 477, July 1983.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5:449--477, 1983.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems, 5:449--477, 1983.

No context found.

Reps T., Teitelbaum T., and Demers A. Incremental context-dependent analysis for language-based editors ACM Trans. Program. Lang. Syst., 5(3):449-477, July1983.

No context found.

T. Reps, T. Teitelbaum, and A. Demers. Incremental Context-Dependent Analysis for Language-based Editors. ACM Transactions on Programming Languages and Systems,

No context found.

T. Reps, T. Teitelbaum and A. Demers, `Incremental context dependent analysis for language18. D. E. Knuth, `Literate programming', The Computer Journal, 27, 77--111 (1984).

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