S-expressions

S-expressions

Software

Published in Dobrivoje Popovic, Vijay P. Bhatkar, Distributed Computer Control for Industrial Automation, 2017

The most outstanding characteristic of LISP is its capability to define and use recursive functions for describing the processes and problems to be solved. LISP programs usually run both in interpretative and interactive way, and are formulated by a set of completely parenthesized symbolic expressions, called s-expressions, in which the operators are given in prefix form. The expressions are stored as list structures, in which two kinds of objects are distinguished: atoms and, again, lists.

Prediction of Online Students Performance by Means of Genetic Programming

View Article

Journal Information

Published in Applied Artificial Intelligence, 2018

Rosa Leonor Ulloa-Cazarez, Cuauhtémoc López-Martín, Alain Abran, Cornelio Yáñez-Márquez

S-expressions are a notation that can be both, source code and data. They can be represented as a parse tree (see Figure 1) more easily to be manipulated (Koza 1998; Sette and Boullart 2001). An s-expression can take many formats such as lists, pairs, symbols, strings, and integers. Lisp uses prefix notation which means that in an s-expression the first element is commonly an operator or function name and the rest of the elements are arguments.

Explore chapters and articles related to this topic

Software

Prediction of Online Students Performance by Means of Genetic Programming