rlpNode.c

Go to the documentation of this file.

/** \file rlpNode.c 

  \brief Routines for building lisp-like lists

*/

#include "rlp.h"

/**AutomaticStart*************************************************************/

/**AutomaticEnd***************************************************************/


/** \brief Allocate a new node */

Rlp_Formula_t *
new_node (Rlp_OperatorEnum_t type,
      Rlp_Formula_t * lchild, Rlp_Formula_t * rchild)
{
  Rlp_Formula_t *tnode;

  tnode = (Rlp_Formula_t *) malloc (sizeof (Rlp_Formula_t));
  tnode->type = type;
  tnode->lchild = lchild;
  tnode->rchild = rchild;

  return tnode;
}


/**
  * \brief List is always a list node with right child another
  * list node or nil.
  */

Rlp_Formula_t *
make2eltlist (Rlp_Formula_t * a, Rlp_Formula_t * b)
{
  Rlp_Formula_t *tnode;

  tnode = (Rlp_Formula_t *) malloc (sizeof (Rlp_Formula_t));
  tnode->type = Rlp_List_c;     // need to ensure that Rlp_List_c is 0
  tnode->lchild = a;

  tnode->rchild = (Rlp_Formula_t *) malloc (sizeof (Rlp_Formula_t));
  tnode->rchild->type = Rlp_List_c;
  tnode->rchild->rchild = NIL (Rlp_Formula_t);
  tnode->rchild->lchild = b;

  return tnode;
}


/** \brief LISP car function */

Rlp_Formula_t *
car (Rlp_Formula_t * a)
{
  return a->lchild;
}


/** \brief LISP cdr function */

Rlp_Formula_t *
cdr (Rlp_Formula_t * a)
{
  return a->rchild;
}


/** \brief print node */

int
node_print (Rlp_Formula_t * a)
{
  if (a == NIL (Rlp_Formula_t))
    {
      printf ("-NIL-\n");
      return 0;
    }
  printf ("Type: %d, Left: %p, Right %p\n", a->type, a->lchild, a->rchild);
  return 0;
}