A Study on APL Interpreter Using Ladder Mechanism

Abstract

APL의 보완은 배열의 접근방식의 변환, 연산자의 재비치, 문법분석, APL의 숙어의 사용등에 의하여 행하여졌다.

본 논문은 배열의 접근방식을 위한 LADDER를 사용하여 APPLE-PASCAL을 이용한 변역기에 의한 A-Machine를 구성하는 방법의 제시이다.

APL implementations have been carried out by transformations of array accessings, reordering of APL operators, syntactical analysis and using APL idioms.

In this study, I propose that A-Machine code is generated by a translator which is written by APPLE-PASCAL using ladder mechanism.

APL implementations have been carried out by transformations of array accessings, reordering of APL operators, syntactical analysis and using APL idioms.

In this study, I propose that A-Machine code is generated by a translator which is written by APPLE-PASCAL using ladder mechanism.