Skip to main content
SpringerLink
Log in

Design, proof and analysis of new efficient algorithms for incremental attribute evaluation

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

  • 144 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Hoover, "Dynamically Bypassing Copy Rule Chains in Attribute Grammars", Conference Record of the 13th ACM Symposium on Principles of Programming Languages, St. Petersburg, Florid, Jan. 1986.

    Google Scholar 

  2. X. Jia & J. Qian, "Incremental Evaluation of Attribute Grammars for Incremental Programming Environments", Proceeding of COMPSAC'85, Chicago, Illinois, Oct. 1985.

    Google Scholar 

  3. G. Johnson, "An Approach to Incremental Semantics", Ph.D Thesis, University of Wisconsin, 1983.

    Google Scholar 

  4. U. Kastens, "Ordered Attribute Grammar", Acta Informatica, Vol. 13, Fasc.3, 1980.

    Google Scholar 

  5. U. Kastens, B. Hutt & E. Zimmermann, "GAG: A Practical Compiler Generator", Lecture Notes in Computer Science, Springer-verlag, Berlin-Heidelberg-New York, 1982.

    Google Scholar 

  6. E. Knuth, "Semantics of Context-Free languages", Mathematical System Theory 2, 2 (June, 1968), 127–145.

    Google Scholar 

  7. E. Knuth, "Semantics of Context-Free Languages: Correction", Mathematical System of Theory 5, 1 (March, 1971), 95–96.

    Google Scholar 

  8. T. Reps, "Generating Language-Based Environment", Technical Report, Department of Computer Science, Cornell University, TR 82–514, Aug. 1982.

    Google Scholar 

  9. T. Reps, C. Marceau & T. Teitelbaum, "Remote Attribute Updating for Language-Based Editors", Conference record of the 13th ACM Symposium on Principles of Programming Languages, St. Petersburg, Florid, Jan. 1986.

    Google Scholar 

  10. T. Reps, T. Teitelbaum & A. Demers, "Incremental Context-Dependent analysis for Language-Based Editors", ACM TOPLAS, Vol.5, No.3, 1983.

    Google Scholar 

  11. T. Teitelbaum & T. Reps, "The Cornell Program Synthesizer: A Syntax-Directed Programming Environment", CACM Vol.24, No.9, September 1981.

    Google Scholar 

  12. D. Yeh, "On Incremental Evaluation of Ordered Attribute Grammar", BIT, Vol.23, No.3, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Fudan University, Shanghai, P.R. China

    Qi Lu & Jiahua Qian

Authors
  1. Qi Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiahua Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, Q., Qian, J. (1988). Design, proof and analysis of new efficient algorithms for incremental attribute evaluation. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017171

Download citation

  • DOI: https://doi.org/10.1007/BFb0017171

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation