An application of compiler technology to the year 2000 problem
✍ Scribed by Mangala Gowri Nanda; Purandar Bhaduri; Sundeep Oberoi; Amitabha Sanyal
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 137 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0038-0644
No coin nor oath required. For personal study only.
✦ Synopsis
This paper describes our experience in developing techniques for repairing date affected programs using standard compiler technology. Starting with date-ness information of certain variables based on their declarations, we propagate this information through all possible control paths, using date inference rules to traverse across individual statements. Our approach is fine grained enough to infer the date-ness of each occurrence of a variable. After detecting date-ness of variables, we renovate programs by applying a transformation using base year strategy. These techniques have been implemented as a tool set for renovating date affected COBOL programs.
📜 SIMILAR VOLUMES
In this letter, an iterati¨e algorithm is presented in order to extend the applicability of the hybrid generalized-multipole-technique ( ) moment-method GMT᎐MoM approach to more complex electromagnetic problems in¨ol¨ing multiobject scatters. The proposed algorithm shows ¨ery fast con¨ergence, pro¨i
The paper presents the non-singular forms of Green's formula and its normal derivative of exterior problems for three-dimensional Laplace's equation. The main advantage of these modi"ed formulations is that they are amenable to solution by directly using quadrature formulas. Thus, the conventional b