A Fast Abstract Syntax Tree Interpreter for R

Kalibera Tomas (1) , Maj Petr , Floréal Morandat (2) , Vitek Jan (1)

1 S3L - Secure Software Systems
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Dynamic languages have been gaining popularity to the point that their performance is starting to matter. The effort required to develop a production-quality, high-performance runtime is, however, staggering and the expertise required to do so is often out of reach of the community maintaining a particular language. Many domain specific languages remain stuck with naive implementations, as they are easy to write and simple to maintain for domain scientists. In this paper, we try to see how far one can push a naive implementation while remaining portable and not requiring expertise in compilers and runtime systems. We choose the R language, a dynamic language used in statistics, as the target of our experiment and adopt the simplest possible implementation strategy, one based on evaluation of abstract syntax trees. We build our interpreter on top of a Java virtual machine and use only facilities available to all Java programmers. We compare our results to other implementations of R.

Domaines: Langage de programmation [cs.PL]; Génie logiciel [cs.SE]

Kalibera Tomas, Maj Petr, Floréal Morandat, Vitek Jan. A Fast Abstract Syntax Tree Interpreter for R. International Conference on Virtual Execution Environments, Mar 2014, New York, NY, USA, United States. pp.89-102, ⟨10.1145/2576195.2576205⟩. ⟨hal-00980342⟩