Skip Navigation

The Computer Journal 1988 31(6):545-549; doi:10.1093/comjnl/31.6.545
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Czech, Z. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Implementation of Detection of Undefined Variables

Z. J. Czech *

Institute of Computer Science, Technical University of Silesia, Pstrowskiego 16, 44-100 Gliwice, Poland

Two algorithms for solving the problem of detecting undefined (or uninitialised) variables during compilation are considered. The first, well-known algorithm solves the problem by computing the use-definition chains for a program flow graph. Its time complexity is O(|N|2) where |N| is a number of nodes of the flow graph. An O(|N|) algorithm is proposed that analyses the direct acyclic graph of a reducible flow graph. The implementation of both algorithms in an Ada compiler are evaluated and compared.

The number of programming languages in use today is very large ... The number of high-quality language implementations, however, is quite small. – W. A. Wulf26

Received October 1985. revised April 1987.

* Institute of Computer Science, Technical University of Silesia, Pstrowskiego 16, 44-100 Gliwice, Poland

§ Present address: University of California, Santa Barbara, California 93106.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.