RADL->APLA Algorithm Program Automatic Transformor Experiment System Study

People have been puzzled by software crisis since 60's. The program's development efficiency and reliability can't fulfil the society's need. On the one hand, sofeware errors cause loss of money , even human life; On the other hand, the useful codes that programmers develop per man are few. The PAR method is a simple and effective method to resolve software crisis and improve software's development efficiency and reliability. This paper's research work is an important component of the PAR method. This research's goal is to develop an auto program transforming the algorithm program described by RADL into the APIA.The follow is the main works of the paper:1, Induct and coordinate the RADL and APLA language.2. Studying not only the grammar and the semantics of RADL language and APLA language but also the relationship between them.3., Summary the rules for transforming a RADL algorithm into an APLA program.4. Implement the automatic transformation from an algorithm described by RADL into an APLA program.5. Using some typical algorithms to test the system.The design of the RADL->APLA transformer is based on PAR method. In order to make the system have highly automation(which can unanimously, reliably, efficiently transform the RADL into a high level language), and software component for reuse, we let the system consist of lexical analysis identifying the lexical symbol of RADL, syntax analysis examining the syntax symbol of RADL, rule factory in which the rules of transforming RADL into APLA is defined. Among them, the lexical analysis and the syntax analysis can be reused later.This transformer has already transformed some typical algorithms described by RADL such as sum array.cube problem and pre-travel tree algorithms into APLA program.