LAB 11 - ciLisp Final Project

In this project, you will implement an interpreter for CI LISP, a Lisp-like language.  

Each task below will expand the grammar.  Your job is to expand the lexer, parser, data structures, parsing methods, and evaluation methods to meet the new requirements. The files provided will build and run, but isn't capable of actually doing anything other than crashing or quitting.

Tasks

TASK 1 : Tokenization, Parsing and Evaluation of Cambridge Polish Notation arithmetic

TASK 2 : Symbol definition and evaluation

TASK 3 : Typecasting

TASK 4 : Conditionals, comparisons, read, random and print

TASK 5 : Composable, recursion-capable user-defined functions

Point Breakdown

• Task 1 : 50 points
• Task 2 : 15 points
• Task 3 : 5 points
• Task 4 : 15 points
• Task 5 : 15 points

Due Dates

• Task 1           November 17
• Task 2:          November 24
• Tasks 3 & 4  December 1
• Task 5           December 9

On the above due dates at 11:59 PM, student must have created a LAB11 directory in their home directory on comp232.com and uploaded all source code and sample test run outputs regardless if the student has completed the task or not.  Instructor needs to see what tasks have been completed on-time or at least what progress has been made.

Points will be deducted for not submitting any updated work by the above Due Dates.

Points can be deducted if student does not meet all Task requirements by the above due dates. 

If student falls behind, instructor can request a one-on-one session to review student’s progress. 

Test input files can be found in the LAB11/INPUTS directory.

Sample outputs from running your ciLisp program need to be found in the

LAB11/OUTPUTS/TASK# directory with file names ending in .txt on comp232.com.  

For example, output from running the Task 1 abs.cilisp test case using your cilisp program need to be found in LAB11/OUTPUTS/TASK1/abs.txt file.  Likewise, output from running the Task 2 test case named task_2.cilisp using your cilisp program need to be found in LAB11/OUTPUTS/TASK2/task_2.txt.

Tasks must be completed in order.

On the above due dates and before December 9th, student must email the instructor stating what progress they have made and if they need any help.

During finals week on December 9^th, the student must have submitted all work before 11:59 PM.  Late work will not be accepted.

On the above due dates:

1. Student must copy all source code files on comp232.com into their LAB11 directory.

 

2. Must copy all test case runs in LAB11/OUTPUTS/TASK# directories.

 

3. Email the instructor stating what progress has been made and if they need any help.

 

4. On or before December 9^th, all work must be uploaded to comp232.com.

        

comp232.com /home/LAB11 Files

Files for this project are found on comp232.com in the /home/LAB11 directory.

 

To download these files from comp232.com, run the following commands:

john@oho:~$ pwd              /home/john	ß Start in your home directory on your laptop.
john@oho:~$ mkdir LAB11	ß Create LAB11 directory.
john@oho:~$ cd LAB11	ß cd to LAB11.
john@oho:~/LAB11$ ls	ß Directory is empty.

john@oho:~/LAB11$ sftp comp232.com ß Run sftp comp232.com.

Connected to comp232.com.

sftp> cd /home/LAB11           ß cd to /home/LAB11

sftp> mget -r *          ß Run mget -r *      DON’T FORGET THE -r

Fetching /home/LAB11/INPUTS/ to INPUTS

Retrieving /home/LAB11/INPUTS

Retrieving /home/LAB11/INPUTS/task_1

/home/LAB11/INPUTS/task_1/hypot.cilisp                    100%  219     2.3KB/s   00:00

/home/LAB11/INPUTS/task_1/max.cilisp                      100%  111     1.3KB/s   00:00

/home/LAB11/INPUTS/task_1/number.cilisp                   100%   58     0.8KB/s   00:00

/home/LAB11/INPUTS/task_1/sqrt.cilisp                     100%  126     0.8KB/s   00:00

/home/LAB11/INPUTS/task_1/neg.cilisp                      100%   64     1.1KB/s   00:00

/home/LAB11/INPUTS/task_1/exp.cilisp                      100%   64     1.2KB/s   00:00

/home/LAB11/INPUTS/task_1/sub.cilisp                      100%  133     2.5KB/s   00:00

/home/LAB11/INPUTS/task_1/composition.cilisp              100%  420     7.0KB/s   00:00

/home/LAB11/INPUTS/task_1/exp2.cilisp                     100%  104     2.0KB/s   00:00

/home/LAB11/INPUTS/task_1/mult.cilisp                     100%  106     1.6KB/s   00:00

/home/LAB11/INPUTS/task_1/log.cilisp                      100%  138     2.5KB/s   00:00

/home/LAB11/INPUTS/task_1/pow.cilisp                      100%  194     3.2KB/s   00:00

/home/LAB11/INPUTS/task_1/cbrt.cilisp                     100%  126     2.2KB/s   00:00

/home/LAB11/INPUTS/task_1/min.cilisp                      100%   83     1.5KB/s   00:00

/home/LAB11/INPUTS/task_1/remainder.cilisp                100%  241     4.6KB/s   00:00

/home/LAB11/INPUTS/task_1/div.cilisp                      100%  150     2.5KB/s   00:00

/home/LAB11/INPUTS/task_1/abs.cilisp                      100%   85     1.6KB/s   00:00

/home/LAB11/INPUTS/task_1/add.cilisp                      100%  110     2.0KB/s   00:00

/home/LAB11/INPUTS/task_5.cilisp                          100%  540     9.3KB/s   00:00

/home/LAB11/INPUTS/task_4_read_target.txt                 100%   39     0.7KB/s   00:00 /home/LAB11/INPUTS/task_3.cilisp                          100%  112     1.8KB/s   00:00

/home/LAB11/INPUTS/task_4.cilisp                          100%  569    10.7KB/s   00:00

/home/LAB11/INPUTS/task_2.cilisp                          100%  705    13.0KB/s   00:00

Fetching /home/LAB11/bison_flex.log to bison_flex.log

Fetching /home/LAB11/cilisp.c to cilisp.c

/home/LAB11/cilisp.c                                      100% 5307    91.8KB/s   00:00

Fetching /home/LAB11/cilisp.h to cilisp.h

/home/LAB11/cilisp.h                                      100% 1605    28.6KB/s   00:00

Fetching /home/LAB11/cilisp.l to cilisp.l

/home/LAB11/cilisp.l                                      100% 1791    30.0KB/s   00:00

Fetching /home/LAB11/cilisp.y to cilisp.y

/home/LAB11/cilisp.y                                      100% 1140    21.7KB/s   00:00

Fetching /home/LAB11/yyreadprint.c to yyreadprint.c

/home/LAB11/yyreadprint.c                                 100% 1957    31.3KB/s   00:00 sftp> quit

 

john@oho:~/LAB11$ ls     ß INPUTS is a directory containing test files.

INPUTS  bison_flex.log  cilisp.c  cilisp.h  cilisp.l  cilisp.y  yyreadprint.c

 

john@oho:~/LAB11$ ls -lR  ß Run a recursive list.

.:

total 24 drwxr-xr-x 1 john john 4096 Nov  2 21:02 INPUTS

-rw-r--r-- 1 john john    0 Nov  2 21:02 bison_flex.log

-rw-r--r-- 1 john john 5307 Nov  2 21:02 cilisp.c

-rw-r--r-- 1 john john 1605 Nov  2 21:02 cilisp.h

-rw-r--r-- 1 john john 1791 Nov  2 21:02 cilisp.l

-rw-r--r-- 1 john john 1140 Nov  2 21:02 cilisp.y

-rw-r--r-- 1 john john 1957 Nov  2 21:02 yyreadprint.c

 

./INPUTS: total 12 drwxr-xr-x 1 john john 4096 Nov  2 21:02 task_1 -rw-r--r-- 1 john john  705 Nov  2 21:02 task_2.cilisp

-rw-r--r-- 1 john john  112 Nov  2 21:02 task_3.cilisp

-rw-r--r-- 1 john john  569 Nov  2 21:02 task_4.cilisp

-rw-r--r-- 1 john john   39 Nov  2 21:02 task_4_read_target.txt

-rw-r--r-- 1 john john  540 Nov  2 21:02 task_5.cilisp

 

./INPUTS/task_1:

total 0

-rw-r--r-- 1 john john  85 Nov  2 21:02 abs.cilisp

-rw-r--r-- 1 john john 110 Nov  2 21:02 add.cilisp -rw-r--r-- 1 john john 126 Nov  2 21:02 cbrt.cilisp

-rw-r--r-- 1 john john 420 Nov  2 21:02 composition.cilisp

-rw-r--r-- 1 john john 150 Nov  2 21:02 div.cilisp

-rw-r--r-- 1 john john  64 Nov  2 21:02 exp.cilisp

-rw-r--r-- 1 john john 104 Nov  2 21:02 exp2.cilisp

-rw-r--r-- 1 john john 219 Nov  2 21:02 hypot.cilisp

-rw-r--r-- 1 john john 138 Nov  2 21:02 log.cilisp

-rw-r--r-- 1 john john 111 Nov  2 21:02 max.cilisp

-rw-r--r-- 1 john john  83 Nov  2 21:02 min.cilisp

-rw-r--r-- 1 john john 106 Nov  2 21:02 mult.cilisp

-rw-r--r-- 1 john john  64 Nov  2 21:02 neg.cilisp

-rw-r--r-- 1 john john  58 Nov  2 21:02 number.cilisp

-rw-r--r-- 1 john john 194 Nov  2 21:02 pow.cilisp

-rw-r--r-- 1 john john 241 Nov  2 21:02 remainder.cilisp

-rw-r--r-- 1 john john 126 Nov  2 21:02 sqrt.cilisp

-rw-r--r-- 1 john john 133 Nov  2 21:02 sub.cilisp

 

john@oho:~/LAB11$

 

 

                   

TASK 1

Recall Cambridge Polish Notation (CPN) in which operators and their operands are enclosed in parenthesis.

For example, (add 1 2) is the CPN equivalent of 1+2.

 

Expressions in CPN can be nested, so the following expression would be valid, and would result in 6.

(add 1 (add 2 3))

 

Your must create a functioning CPN calculator which works with the functions listed in the FUNC_TYPE enum in the provided code through the MIN_FUNC function (all functions appearing after MIN_FUNC in the enum will be implemented in later tasks.

This calculator will serve as the core functionality for CI-LISP.

You may want to check out the sample runs below better understand what will be implemented before reading further.

The initial grammar is as follows:

program ::= s_expr EOL | s_expr EOFT | EOL | EOFT

 

s_expr ::= f_expr | number | QUIT

 

f_expr ::= ( FUNC s_expr_section )

 

s_expr_section ::= s_expr_list | <empty>

 

s_expr_list ::= s_expr | s_expr s_expr_list

 

FUNC ::= neg | abs | add | sub |  mult | div | remainder | exp |  exp2 | pow | log | sqrt |  cbrt | hypot | max | min

 

number ::= INT | DOUBLE

 

INT ::= optional +/-,  then some digits

 

DOUBLE ::= optional +/-,  then some digits,  then a decimal point,

 then optionally some more digits

 

QUIT ::= quit

 

The non-terminals s_expr and f_expr are shorthand:

• s_expr means symbolic expression
• f_expr means function expression

DATA STRUCTURES

Next we'll discuss the structures provided in cilisp.h. For a more intuitive understanding of the structures and their names defined here, note that AST is short for __A__bstract __S__yntax __T__ree. As such, the structures discussed below are intended to house data in an abstract syntax tree.

NUMBERS

The NUM_TYPE enum and AST_NUMBER struct define everything necessary to house both numeric data types (integers and floating point values) in a single struct.

typedef enum num_type {

    INT_TYPE,

    DOUBLE_TYPE

} NUM_TYPE;

 typedef struct {     NUM_TYPE type;     double value;

} AST_NUMBER;

 typedef AST_NUMBER RET_VAL;

Note that even when an AST_NUMBER's type is INT_TYPE, we will be storing it's actual value as a double under the hood. This is to make function evaluation a little less tedious; students wishing to instead use this alternative AST_NUMBER are welcome to do so:

typedef struct {     NUM_TYPE type;     union {

        double floating_point;         long integral;

    } value;

} AST_NUMBER;

Each AST_NUMBER will house a member of the NUM_TYPE enum (denoting the type of number being stored) alongside a numeric value.

The last line, which gives the AST_NUMBER struct a second name (RET_VAL), exists exclusively for readability; when we evaluate a part of our syntax tree, the result will always be a number. We will use AST_NUMBERs to house numbers which are part of the syntax tree, and RET_VALs to house the results of evaulation (__RET__urned __VAL__ues).

FUNCTIONS

The terms "operator" and "function" will be used interchangeably for our discussion here.

We'll start our discussion of functions with the enum and struct definitions in cilisp.h.

typedef enum func_type {

    NEG_FUNC,

    ABS_FUNC,

    ADD_FUNC,

    // TODO complete the enum

    CUSTOM_FUNC } FUNC_TYPE;

This enum will list all functions which will be implemented throughout the course of the project. Clearly, it isn't yet complete, hence the TODO. You'll add more functions to it as you work through this task, and through future tasks.

When function calls are parsed as f_exprs, the data for said calls will be stored in an AST_FUNCTION:

typedef struct {     FUNC_TYPE func;     struct ast_node *opList; } AST_FUNCTION;

This struct stores the operator used in the function call (a member of the FUNC_TYPE enum) and the operands for the function (a linked list of struct ast_nodes, which we will discuss in the GENERIC NODES section below).

Take note of the resolveFunc function cilisp.c. This function takes as input a function's name (in string form), and outputs the corresponding FUNC_TYPE member. It will be used to assign value to FUNC tokens while lexing.

resolveFunc works because the array of function names (funcNames, in cilisp.c) lists all functions in the same order as the FUNC_TYPE enum. If either of these is edited, the other must also be edited to match. If they are not kept in sync, resolveFunc will not work. CUSTOM_FUNC should be left as the last element of resolveFunc for the same reason; user-defined functions will be implemented at the end of the project, and we'll know a function is user-defined if we make it through the whole funcNames array without finding the name of the function.

GENERIC NODES

We've already discussed two types of abstract syntax tree nodes for housing numbers and functions. In order to make these types of nodes interchangeable, it is necessary to wrap them in a generic abstract syntax tree node which can store either type of node.

As such, we have the AST_NODE type:

typedef enum {     NUM_NODE_TYPE,

    FUNC_NODE_TYPE

} AST_NODE_TYPE;

 typedef struct ast_node {     AST_NODE_TYPE type;     union {

        AST_NUMBER number;

        AST_FUNCTION function;

    } data;

    struct ast_node *next;

} AST_NODE;

An AST_NODE stores a member of the AST_NODE_TYPE enum in it's type field, so it can be determined what type of node is housed in its data field (a union which can store either a AST_NUMBER or a AST_FUNCTION). It also stores a pointer to another AST_NODE in its next field, which allows AST_NODEs to be stored in a linked list style for use as operands (see the opList field in AST_FUNCTION).

LEXING

First, it is necessary to define all tokens and all non-terminals within the grammar. tokens (and nonterminals, called types by yacc), will be defined in cilisp.y in the definitions section. The provided token and type definitions are:

%union {     double dval;     int ival;

    struct ast_node *astNode;

};

 

%token <ival> FUNC

%token <dval> INT

%token QUIT EOL EOFT

 

%type <astNode> s_expr

Clearly, this is incomplete; you should know from the previous labs how to complete this definitions section, and we will not discuss it further here (but as always, questions are welcome).

The union contains all types that tokens and types will have. In this case, token and type values will all be stored as double, int or ast_node *.

The tokens defined by the yacc file must be lexed. As we know, the lex file is used to configure a lexer.

The provided cilisp.l is barely started. It has rules to tokenize and return some tokens, but not all of them. You must complete it.

Pay attention to the llog calls made for debugging purposes each time a token is created. Just like in the lab, these calls print to a log file src/bison-flex-outputs/flex_bison_log. Every rule in cilisp.l should include an llog call.

PARSING

The goal of the parser is to construct an abstract syntax tree after tokenization. Most of the productions in your grammar will have an equivalent production in cilisp.y, which is the configuration file for the parser.

The first set of productions in cilisp.y are for parsing programs, which serve as an entry point. The productions are provided, and should be changed cautiously if at all. Productions for s_expr ::= error and s_expr ::= QUIT are also provided. program: 

    s_expr EOL {

        ylog(program, s_expr EOL);         if ($1) {

            printRetVal(eval($1));             freeNode($1);

        }

        YYACCEPT;

    }

    | s_expr EOFT {

        ylog(program, s_expr EOFT);         if ($1) {

            printRetVal(eval($1));             freeNode($1);

        }

        exit(EXIT_SUCCESS);

    }     | EOL {

        ylog(program, EOL);

        YYACCEPT;  // paranoic; main skips blank lines

    }     | EOFT {

        ylog(program, EOFT);         exit(EXIT_SUCCESS);

    };

  s_expr:     QUIT {

        ylog(s_expr, QUIT);         exit(EXIT_SUCCESS);

    }     | error {

        ylog(s_expr, error);         yyerror("unexpected token");

        $$ = NULL;

    };

Note that every production has a ylog call; this function, like llog, prints to the log file stating what lexing and parsing steps are taken. Every production that you add should include a ylog file, as well, as the log will be a crucial tool in debugging the lexer and parser.

The rest of the yacc file is up to you.

The figure below (which can be found here) may help you visualize what needs to be done. Note that some reductions in the grammar are not illustrated in the figure.

You are strongly encouraged to illustrate productions like this as you go through the project, and to occasionally draw out entire syntax trees for test inputs.

 

Many of these productions will need to call the functions declared at the bottom of cilisp.h:

 

AST_NODE *createNumberNode(double value, NUM_TYPE type);

AST_NODE *createFunctionNode(FUNC_TYPE func, AST_NODE *opList);

AST_NODE *addExpressionToList(AST_NODE *newExpr, AST_NODE *exprList);

These functions are defined in cilisp.c; some of their definitions are partially completed already.

Whenever a function or value needs to be accessible by the lexer or parser, it must be declared in cilisp.h.

For instance, in the number ::= INT production, you will likely want to assign $$ (the value of the number) to the result of a call to createNumberNode, which should create an AST_NODE housing an AST_NUMBER whose data is populated with that from the INT token (i.e. its double value) and the type (INT_TYPE, from the NUMBER_TYPE enum).

Both createNumberNode and INT_TYPE are accessible to the parser because they are declared in cilisp.h.

EVALUATION

GENERIC EVALUATION

Once parsing is complete (i.e. when a series of tokens is reduced to a sequence s_expr

EOL or s_expr EOFT, the contents of a single program) the eval function is called on the root s_expr. You can see this call in the provided program ::= s_expr EOL production in cilisp.y. This function is the entry point for a recursive system of functions whose purpose is to evaluate the syntax tree and output the resulting RET_VAL.

 

While it is generally bad practice to pass structs by value, we will make an exception for the RET_VAL struct, which is sufficiently small for the issue to be irrelevant. Of course, if you wish to pass them around by reference instead, you're welcome to do so.

The eval function takes as input a generic AST_NODE *. Its job is to determine which type of AST_NODE is referrenced and call the corresponding function to evaluate it. That is, eval must determine if the referenced AST_NODE is of type NUM_NODE_TYPE or FUNC_NODE_TYPE and call evalNumNode or evalFuncNode on it respectively.

This process is similar to the evaluation prodedure carried out in the parser lab; no individual evaluation function should be too complex because of the recursive setup. For instance, when evaluating a function, you must evaluate its operands, but you don't need to do this by hand in evalFuncNode; you can instead simply call eval on each operand, and use the resulting RET_VALs as operands for the function evaluation.

NUMBER EVALUATION

evalNumNode should be quick and easy; recall that a RET_VAL is really just an AST_NUMBER under a different name.

FUNCTION EVALUATION

evalFuncNode should check which FUNC_TYPE the AST_FUNCTION contains, and call an appropriate function to evaluate the result of running that operation with the input referenced linked list of operands. For instance, if the function being evaluated has type NEG_TYPE, you might pass it off to a function called evalNegFunction (which you'll need to add).

That is, evalFuncNode should be a glorified switch or if/else cascade, which just calls the individual function evaluation procedures. I strongly advise against doing said procedures inside of evalFuncNode instead of making these helper functions; it's totally doable, but it's also more tedious to read, debug, and expand.

Much of the work in function evaluation is catching and dealing with fringe cases. Often, you will need to print warnings as described in the function desciptions and sample runs below. Use the warning function, provided in cilisp.c for this purpose. It is essentically printf with a couple extra features to keep the console output pretty and well-spaced. It also prepends "WARNING: " onto whatever formatted string you pass it.

FUNCTION SPECIFICATIONS

Unary functions take 1 operand, binary take 2 operands, and n-ary take any number of operands. Functions which are given too few operands should print warnings and return NAN_RET_VAL (defined in cilisp.h) unless otherwise specified below. Functions which are given too many operands should print warnings stating that the extra operands were ignored, and then only use the required number of operands in calculation. If extra operands are provided, the leftmost operands should be used and the extras on the right ignored.

 

Check out the math.h library (open the console and type man math to get its documentation) before starting these implementations. Be careful: many of the math.h library functions don't behave as the specifications below describe, despite similar nomenclature. For instance, math.h's remainder can return a negative value, but the specifications for the remainder function below specify that the result must be positive.

• neg o unary o returns the negation of the operand _o i.e. given x returns -x
• abs o unary

                      o    returns the absolute value of the operand

• add o n-ary
  • • returns the sum of its operands o return type depends on input types
    • if given no inputs, prints warning and returns 0 as an integer
• sub o binary

o    returns result of subtracting second operand from first operand o         return type depends on operand types

• mult o n-ary
  • returns the product of the operands o       return type depends on operand types o       if given no inputs, prints warning and returns 1 as an integer
• div o binary o returns the result of division of the first operand by second operand o return type depends on operand types o int division if done with 2 integers
• remainder _o binary (a and b input) _o returns an r such that:
  • • • a = q * b + r
      • q is an integer
      • 0 <= r < | b |
• exp o unary
  • returns e raised to the specified power o     always returns a double
• exp2 o unary
  • returns 2 raised to the specified power o     if operand is negative, return type is always double o       otherwise, return type depends on operand type
• pow
  • binary o       returns first operand raised to power of second operand o return type depends on operand types
• log o unary o returns natural log of operand o always returns a double
• sqrt o unary
  • returns the square root of the operand o always returns a double
• cbrt o unary
  • returns the cube root of the input o       always returns a double
• hypot o n-ary

o    returns the square root of the sum of squares of operands o        if given no inputs, prints a warning and returns 0 o     always returns a double o math.h's hypot only take 2 arguments; you'll need to build this by hand

• max o n-ary o returns maximum value among the operands o return type is the type of the maximum operand o if given no operands, prints a warning and returns nan
• min o n-ary o returns minimum value among the operands o return type is the type of the minimum operand o if given no operands, prints a warning and returns nan

SAMPLE RUNS

In the sample runs below, inputs are on the same line as the > , and the output is printed below

(along with any warnings). The inputs shown in these sample runs are all provided in the inputs/task_1 directory. You can edit the run configurations to provide a path to an input file, or run without any arguments and type inputs in by hand. The provided input files have quit so sample runs match runs done by hand, but this is unnecessary with file inputs; the program will end when an EOF is encounters as well.

 

You are encouraged to come up with a composite test input of your own, to test all of task 1, once your implementation matches the sample runs for all provided inputs.

When you're done implementing your lexing, parsing and evaluation procedures to match the sample runs below, don't forget to read the CLEANING UP section below.

number

> 0

Integer : 0

 

> 0.

Double : 0.000000

 

> 1

Integer : 1

 > 1.

Double : 1.000000

 

> 0.0

Double : 0.000000

 

> 0.5

Double : 0.500000

 

> +0

Integer : 0

 

> +10.55

Double : 10.550000

 

> -12.87

Double : -12.870000  > -12.

Double : -12.000000

 

> -12

Integer : -12

 

> .34 

WARNING: Invalid character >>.<<

Integer : 34

 

Process finished with exit code 0 neg

> (neg 5)

Integer : -5

 

> (neg 5.5)

Double : -5.500000

 

> (neg -5.0)

Double : 5.000000

 

> (neg -5)

Integer : 5

 

> (neg)

WARNING: neg called with no operands! nan returned!

Double : nan

 

> (neg 1 2)

WARNING: neg called with extra (ignored) operands!

Integer : -1

 

> quit 

 

Process finished with exit code 0 abs

> (abs 1)

Integer : 1

 

> (abs 1.2)

Double : 1.200000

 

> (abs -3)

Integer : 3

 

> (abs 0)

Integer : 0

 

> (abs 0.0)

Double : 0.000000

 

> (abs -1.4)

Double : 1.400000

 

> (abs)

WARNING: abs called with no operands! nan returned!

Double : nan

 

> (abs -1 2)

WARNING: abs call with extra (ignored) operands!

Integer : 1

 

> quit 

 

Process finished with exit code 0 add

> (add)

WARNING: add call with no operands, 0 returned!

Integer : 0

 

> (add 1)

Integer : 1

 

> (add 1.0)

Double : 1.000000

 

> (add 1 2 3 4 5)

Integer : 15

 

> (add 1 -2 3 -4 5 -6)

Integer : -3

 

> (add 0.0 1 -2 3 -4 5 -6)

Double : -3.000000

 

> (add 1 -1.0)

Double : 0.000000

 

> quit 

 

Process finished with exit code 0

 

sub

> (sub)

WARNING: sub called with no operands!

Double : nan

 

> (sub 1)

WARNING: sub called with only one arg!

Double : nan

 

> (sub 1.0)

WARNING: sub called with only one arg!

Double : nan

 

> (sub 1 2)

Integer : -1

 

> (sub 2 1)

Integer : 1

 

> (sub 2 -1)

Integer : 3

 

> (sub 2.0 1)

Double : 1.000000

 

> (sub 2.0 -1)

Double : 3.000000

 

> (sub 1 1.0)

Double : 0.000000

 

> (sub 2.0 1.0)

Double : 1.000000

 

> (sub 1 2 3)

WARNING: sub called with extra (ignored) operands!

Integer : -1

 

> quit 

 

Process finished with exit code 0 mult

> (mult)

WARNING: mult called with no operands! 1 returned!

Integer : 1

 

> (mult 1)

Integer : 1

 

> (mult 1.0)

Double : 1.000000

 

> (mult -1)

Integer : -1

 

> (mult -1 -1.0)

Double : 1.000000

 

> (mult 1 -2 3 -4 5)

Integer : 120

 

> (mult -1.0 2 -3.0 4 -5)

Double : -120.000000

 

> quit 

 

Process finished with exit code 0 div

> (div)

WARNING: div called with no operands! nan returned!

Double : nan

 

> (div 1)

WARNING: div called with only one arg! nan returned!

Double : nan

 

> (div 1.0)

WARNING: div called with only one arg! nan returned!

Double : nan

 

> (div 1 2)

Integer : 0

 

> (div 1.0 2)

Double : 0.500000

 

> (div 2 1)

Integer : 2

 

> (div 2.0 1)

Double : 2.000000

 

> (div 5 2.0)

Double : 2.500000

 

> (div -20.0 4)

Double : -5.000000

 

> (div 1 2 3 4)

WARNING: div called with extra (ignored) operands!

Integer : 0

 

> (div 1 2 3)

WARNING: div called with extra (ignored) operands!

Integer : 0

 

> (div 5.0 2 3)

WARNING: div called with extra (ignored) operands!

Double : 2.500000

 

> quit 

 

Process finished with exit code 0 remainder

> (remainder)

WARNING: remainder called with no operands! nan returned!

Double : nan

 

> (remainder 1)

WARNING: remainder called with one arg! nan returned!

Double : nan

 

> (remainder 0)

WARNING: remainder called with one arg! nan returned!

Double : nan

 

> (remainder -1.0)

WARNING: remainder called with one arg! nan returned!

Double : nan

 

> (remainder 1 2)

Integer : 1

 

> (remainder 2 1)

Integer : 0

 

> (remainder 2.5 1)

Double : 0.500000

 

> (remainder 2 3)

Integer : 2

 

> (remainder -6 10)

Integer : 4

 

> (remainder -6.0 10.0)

Double : 4.000000

 

> (remainder -6.0 -10.0)

Double : 4.000000

 

> (remainder 1 2 3)

WARNING: remainder called with extra (ignored) operands!

Integer : 1

 

> (remainder 23 7 10)

WARNING: remainder called with extra (ignored) operands!

Integer : 2

 

> quit 

 

Process finished with exit code 0 exp

> (exp)

WARNING: exp called with no operands! nan returned!

Double : nan

 

> (exp 1)

Double : 2.718282

 

> (exp -1)

Double : 0.367879

 

> (exp 5.0)

Double : 148.413159

 

> (exp -2.0)

Double : 0.135335

 

> (exp 1 2)

WARNING: exp called with extra (ignored) operands!

Double : 2.718282

 

> quit 

 

Process finished with exit code 0 exp2

> (exp2)

WARNING: exp2 called with no operands! nan returned!

Double : nan

 

> (exp2 1)

Integer : 2

 

> (exp2 1.0)

Double : 2.000000

 

> (exp2 0)

Integer : 1

 

> (exp2 0.0)

Double : 1.000000

 

> (exp2 0.5)

Double : 1.414214

 

> (exp2 -2)

Double : 0.250000

 

> (exp2 20.0)

Double : 1048576.000000

 

> (exp2 1 2)

WARNING: exp2 called with extra (ignored) operands!

Integer : 2

 

> quit 

 

Process finished with exit code 0

pow

> (pow)

WARNING: pow called with no operands! nan returned!

Double : nan

 

> (pow 1)

WARNING: pow called with only one operand! nan returned!

Double : nan

 

> (pow 1.0)

WARNING: pow called with only one operand! nan returned!

Double : nan

 

> (pow 1 1)

Integer : 1

 

> (pow 1 1.0)

Double : 1.000000

 

> (pow 2 1)

Integer : 2

 

> (pow 2.1 1)

Double : 2.100000

 

> (pow -2 0.5)

Double : nan

 

> (pow -2 0)

Integer : 1

 

> (pow -2.0 0.0)

Double : 1.000000

 

> (pow -2.0 0)

Double : 1.000000

 

> (pow 3 3)

Integer : 27

 

> (pow 3.0 3)

Double : 27.000000

(pow 27 (div 1 3.0))

3.000000

(pow 1 2 3)

WARNING: pow called with extra (ignored) operands!

Integer : 1

 

> quit 

 

Process finished with exit code 0 log

> (log)

WARNING: log called with no operands! nan returned!

Double : nan

 

> (log 1)

Double : 0.000000

 

> (log 0)

Double : -inf

 

> (log -1)

Double : nan

 

> (log 0.0)

Double : -inf

 

> (log -1.0)

Double : nan

 

> (log (exp 1))

Double : 1.000000

 

> (div (log 27) (log 3))

Double : 3.000000

 

> (div (log 27.0) (log 3))

Double : 3.000000

 

> (log 1 2)

WARNING: log called with extra (ignored) operands!

Double : 0.000000

 

> quit 

 

Process finished with exit code 0 sqrt

> (sqrt)

WARNING: sqrt called with no operands! nan returned! Double : nan

(sqrt 1)

1.000000

(sqrt 1.0)

Double : 1.000000

 

> (sqrt 0)

Double : 0.000000

 

> (sqrt 0.0)

Double : 0.000000

 

> (sqrt -1)

Double : nan

 

> (sqrt -1.0)

Double : nan

 

> (sqrt 4)

Double : 2.000000

 

> (sqrt 170.0)

Double : 13.038405

 

> (sqrt 2)

Double : 1.414214

 

> (sqrt 1 2)

WARNING: sqrt called with extra (ignored) operands!

Double : 1.000000

 

> quit 

 

Process finished with exit code 0 cbrt

> (cbrt)

WARNING: cbrt called with no operands! nan returned!

Double : nan

 

> (cbrt 0)

Double : 0.000000

 

> (cbrt 0.0)

Double : 0.000000

 

> (cbrt -1)

Double : -1.000000

 

> (cbrt -1.0)

Double : -1.000000

 

> (cbrt 1)

Double : 1.000000

(cbrt 1.0)

1.000000

(cbrt 27)

Double : 3.000000

 

> (cbrt 27.0)

Double : 3.000000

 

> (cbrt 4)

Double : 1.587401

 

> (cbrt 1 2)

WARNING: cbrt called with extra (ignored) operands!

Double : 1.000000

 

> quit 

 

Process finished with exit code 0 hypot

> (hypot)

WARNING: hypot called with no operands! 0 returned!

Double : 0.000000

 

> (hypot 1)

Double : 1.000000

 

> (hypot 1.0)

Double : 1.000000

 

> (hypot 3 4)

Double : 5.000000

 

> (hypot -3 4)

Double : 5.000000

 

> (hypot -30 -40.0)

Double : 50.000000

 

> (hypot 4 4 7)

Double : 9.000000

 

> (hypot 7.0 4 4.0)

Double : 9.000000

 

> (hypot 12 13 14)

Double : 22.561028

 

> (hypot 5 5 5)

Double : 8.660254

 

> (hypot -5 -5.0 (sqrt 25))

Double : 8.660254

(hypot 0 0 0.0 -3 0 0 0 0 4 0.0 -0.0 12)

13.000000