| Susan B. Horwitz. Generating language-based editors: A relationally-attributed approach. Technical Report TR 85-696, Department of Computer Science, Cornell University, 1985. |
....reuse, Colander II provides for ned grained programmer control of these tradeo s via a system of pragmatic annotations in the analysis descriptions. Analysis speci cations are written in a style similar to attribute grammars, but with extensions inspired by the work of Ballance [3] and Horwitz [13]. Our speci cation metalanguage provides unusually rich modeling resources adapted from deductive and object oriented database technology, including objects and relations. While justi able entirely on the grounds of modeling expressiveness, judicious use of objects and relations can make the ....
Susan B. Horwitz. Generating language-based editors: A relationally-attributed approach. Technical Report TR 85-696, Department of Computer Science, Cornell University, 1985.
....of the current AST, independently of the sequence of editing operations that created it. In fact, even this is not precisely true due to the existence of a few operations that are exempted from the consistency maintenance discipline. 11 the excessive use of dynamic dependency traces. Horwitz [39] and Horwitz and Teitelbaum [38] augmented a traditional attribute grammar with global relations into which the nodes of the AST could induce one or more tuples, possibly conditionally. They use incremental view maintenance techniques, akin to those developed in the relational database community, ....
....an explicit list of bindings. Because the use of relations does not commit to the data structure used to represent them, the implementation is given more freedom to choose an appropriate one. Our treatment of relations as full fledged attributes was anticipated by Sataluri and Fleck [69] Horwitz [39] defines a notion of relational attribution that is akin to our collections. Her relations are global, however, and do not decorate the AST itself. Throughout the discussion so far, we have hinted at the synergy between the ADL language design and the requirements of incremental execution. We ....
[Article contains additional citation context not shown here]
Susan B. Horwitz. Generating language-based editors: A relationally-attributed approach. Technical Report TR 85-696, Department of Computer Science, Cornell University, 1985. Ph.D. dissertation.
....This results in a trivial relationship between modifications and re analysis: each modified token and each token that 8 Either left context, in the form of a specific state, or right context, in the form of lookahead as discussed in the next section. Long range dependencies such as name binding [Horwitz 1985] are outside the purview of incremental lexing, and we will never mean this type of relationship when we use the term contextual dependency . written for ACM Transactions on Programming Languages and Systems, December 6, 1999 at 02 : 21. General Incremental Lexing Delta 11 token stream token ....
HORWITZ, S. B. 1985. Generating language-based editors: A relationally-attributed approach. Tech. Rep. TR 85-696, Department of Computer Science, Cornell University.
.... complex structured attributes, which is a severe handicap for any incremental attribute evaluation algorithm [32] Some research has been undertaken to overcome the disadvantages and principal restrictions of the classical attribute tree grammar formalism in modeling context sensitive relations [21]. This research still adheres to the data model of an attributed tree, proposes the introduction of remote references (relations) and or tree valued attributes, and still suffers from the above mentioned problems, when specifying inherently graph like structures and operations (cf. example of ....
Horwitz S.: Generating Language Based Editors: a Relationally-Attributed Approach, Ph.D. Thesis, Cornell University, Ithaca, N.Y (1985)
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