Skip to main content
SpringerLink
Log in

An O(n) algorithm for computing the set of available expressions of D-charts

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper, an idea for computing the set of available expressions at entrance to the nodes of D-charts is explained. An algorithm based on the idea will work in time O(n), given bit vector operations, where n is the number of nodes. D-charts are flow graphs which correspond to the programs where ifs and whiles are used as control statements. The paper is based on the authors' previous report [9].

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ullman, J.D.: Fast algorithms for the elimination of common subexpressions. Acta Informatica 2, 191–213 (1973)

    Google Scholar 

  2. Schaefer, M.: A mathematical theory of global program optimization. Englewood Cliffs (N. J.): Prentice Hall 1973

    Google Scholar 

  3. Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling: Vol. II-Compiling. Englewood Cliffs (N.J.): Prentice Hall 1973

    Google Scholar 

  4. Kennedy, K.: A global flow analysis algorithm. International. J. Computer Mathematics. 3, 5–15 (1971)

    Google Scholar 

  5. Allen, F.E.: A basis for program optimization. Proc. IFIP Conf. 71. Amsterdam: North Holland 1972

    Google Scholar 

  6. Ashcroft, E., Manna, Z.: The translation of ‘GO TO’ programs to ‘WHILE’ programs. Proc. IFIP Conf. 71. Amsterdam: North Holland 1972

    Google Scholar 

  7. Furuta, S., Tokura, N., Kasami, T.: Programs without ‘GO TO’ and the reducibility (in Japanese). National Conv. Record of Institute of Electronics and Communication Engineers of Japan, 1973

  8. Furuta, S., Tokura, N., Kasami, T.: An algorithm for detecting D-charts (in Japanese). Institute of Electronics and Communication Engineers of Japan, Papers of Technical Group on Automata and Languages, 1973

  9. Taniguchi, K., Kasami, T.: An O(n) algorithm for computing the IN function of D-charts (in Japanese). Institute of Electronics and Communication Engineers of Japan, Papers of Technical Group on Automata and Languages, January 1974.

  10. Graham, S. L., Wegman, M.: A fast and usually linear algorithm for global flow analysis. J. ACM 23, 172–202 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Sciences Faculty of Engineering Science, Osaka University, 560, Toyonaka-shi, Japan

    K. Taniguchi & T. Kasami

Authors
  1. K. Taniguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Kasami
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taniguchi, K., Kasami, T. An O(n) algorithm for computing the set of available expressions of D-charts. Acta Informatica 6, 361–364 (1976). https://doi.org/10.1007/BF00268137

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation