,

On the Performance of Bytecode Interpreters in Prolog

, , и .
Functional and Constraint Logic Programming, стр. 41--56. Springer, (2021)
DOI: 10.1007/978-3-030-75333-7_3

Аннотация

The semantics and the recursive execution model of Prolog make it very natural to express language interpreters in form of AST (Abstract Syntax Tree) interpreters where the execution follows the tree representation of a program. An alternative implementation technique is that of bytecode interpreters. These interpreters transform the program into a compact and linear representation before evaluating it and are generally considered to be faster and to make better use of resources.

тэги

Пользователи данного ресурса

  • @gron

Комментарии и рецензии