Scott E. Hudson
- 1 ALPERN, B., CARLE, A., ROSEN, B., SWEENEY, 1~ , AND ZADECI~, K. Incremental evaluation of attributed graphs. Res. Rep. RC 13205, IBM Corp., Armonk, N Y., Oct. 1987.Google Scholar
- 2 ALPERN, B., CARLE, A., ROSEN, B., SWEENEY, P., AND ZADECK, K. Graph attribution as a specification paradigm. In Proeeeclings of the Symposium on Pra~tieal Software Development Envlronments (Boston, Nov. 1988) ACM SIGSOFT/SIGPLAN, pp. 121-129. Google Scholar
- 3 DEMERS, A, ROGERS, A., AND ZADECt~, F. K Attribute propagation by message passing In Proceedings of the ACM-SIGPLAN 85 Symposium on Language Issues in Programming Enwronments (Seattle, Wash., 25-28 June 1985). ACM, New York, 1985, pp. 43-59. Google Scholar
- 4 DERANSART, P., JOURDAN, M., AND LORHO, B. Attribute Grammars: Definitior~s, Systems and Bibliography. Lecture Notes in Computer Science, vol. 323, SpringerWertag, New York, Aug. 1988. Google Scholar
- 5 FARROW, R. W. Attributed grammar models for data fiow analysis. Ph.D. dissertation, Dept. of Computer Science, Rice Univ., Houston, Tex., May 1977. Google Scholar
- 6 FARROW, R. Automatic generation of fixed-point-finding evaluators for circular but well-defined attribute grammars. ACM SIGPLAN Not. 21, 7 (July 1986), 85-98. Google Scholar
- 7 HoovEo~, R. Dynamically bypassing copy rule chains in attribute grammars. In Conference Record of the 13th Annual ACM Symposium on Principles of Programming Languages (St. Petersburg Beach, Fl., Jan. 1986) ACM, New York, 1986, pp. 14-25. Google Scholar
- 8 HOOVER, R. Incremental graph evaluation. Ph.D. thesis, Cornell Univ., Ithaca, N.Y. 1987. Google Scholar
- 9 tIunsoN, S. E., AND KING, R. Semantic feedback in the Higgens UIMS. IEEE Trans. Sofiw. Eng. 14, 8 (Aug. 1988), 1188-1206. Google Scholar
- 10 JOHNSON, G. F., AND FmCHER, C.N. Non-syntactic attribute fiow in language based editors. In Conference Record of the 9th Annual ACM Symposium on Principles of Programming Languages (Albuquerque, N.M., Jan. 1982). ACM, New York, 1982, pp. 185-195. Google Scholar
- 11 KASTENS, U. Ordered attribute grammars. Acta Inf. 13 (1980), 229-256Google Scholar
- 12 KENNEDY, K., AND WAR~E~, S.K. Automatic generation of efficient evaluators for attribute grammars. In Conference Record of the 3rd ACM Symposium on Prmciples of Programmmg Languages. ACM, New York, 1976, pp. 32-49. Google Scholar
- 13 KNUTS, D. E. Semantics of context-free languages. Math. Syst. Theor. J. 2 (aune 1968), 127-145.Google Scholar
- 14 REPS, T., MARCEAU, C., AND TEITELBAUM, T. Remote attribute updating for language-based editors. In Conference Record of the 13th Annual ACM Symposium on Principles of Programming Languages (St. Petersburg Beach, Fl., Jan. 1986). ACM, New York, 1986, pp. 1-13. Google Scholar
- 15 REPS. T., TEITELBAUM, T., AND DEMERS, A. Incremental context-dependent analysis for language-based editors. ACM Trans. Program Lang. Syst. 5, 3 (July 1983), 449-477. Google Scholar
- 16 REPS. T. W. Generating Language-Based Environments. MIT Press, Cambridge, Mass., 1984. Google Scholar
- 17 WAITE, W. M., AND Goos, G. Compiler Construction. Springer-Verlag, New York, 1984. Google Scholar
- 18 WALZ, J., AND JO~SON, G. Incremental evaluation for a general class of circular attribute grammars. ACM SIGPLAN Not. 23, 7 (July 1988), 209-221. Google Scholar
- 19 YEH, D. On incremental evaluation of ordered attributed grammars. Bit 23 (1983), 308-320.Google Scholar
Index Terms
- Incremental attribute evaluation: a flexible algorithm for lazy update
Recommendations
Incremental attribute evaluation through recursive procedures
Incremental semantic analysis in a programming environment based on Attribute Grammars is performed by an Incremental Attribute Evaluator (IAE). Current IAEs are either table-driven or make extensive use of graph structures to schedule reevaluation of ...
On incremental evaluation of ordered attributed grammars
AbstractA method is presented to augment a conventional evaluator for an ordered attributed grammar into an incremental one, though it is applicable to tree-walker evaluators for any non-circular attributed grammars. Also three improvements are suggested. ...
Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements
A solution to the problem of incremental attribute evaluation for multiple asynchronous subtree replacements that is applicable to arbitrary noncircular attribute grammars is discussed. The algorithm supports multiple independent editing cursors. ...
Comments