ack/lang/m2/comp/node.c

172 lines
2.5 KiB
C
Raw Normal View History

/*
* (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
* See the copyright notice in the ACK home directory, in the file "Copyright".
*
* Author: Ceriel J.H. Jacobs
*/
1986-04-06 17:42:56 +00:00
/* N O D E O F A N A B S T R A C T P A R S E T R E E */
/* $Header$ */
1986-05-01 19:06:53 +00:00
#include "debug.h"
1986-04-06 17:42:56 +00:00
#include <em_label.h>
#include <em_arith.h>
#include <alloc.h>
1986-04-07 17:40:38 +00:00
#include <system.h>
1986-05-01 19:06:53 +00:00
#include "LLlex.h"
1986-04-06 17:42:56 +00:00
#include "def.h"
#include "type.h"
#include "node.h"
1988-03-22 17:54:01 +00:00
#include "main.h"
1986-04-06 17:42:56 +00:00
static int nsubnodes[] = {
0,
2,
2,
2,
2,
2,
1,
1,
2,
1,
2,
1,
2
};
t_node *
getnode(class)
{
register t_node *nd = new_node();
if (options['R']) nd->nd_flags |= ROPTION;
if (options['A']) nd->nd_flags |= AOPTION;
nd->nd_class = class;
return nd;
}
t_node *
1986-04-06 17:42:56 +00:00
MkNode(class, left, right, token)
t_node *left, *right;
t_token *token;
1986-04-06 17:42:56 +00:00
{
/* Create a node and initialize it with the given parameters
*/
register t_node *nd = getnode(class);
1986-04-06 17:42:56 +00:00
nd->nd_token = *token;
nd->nd_LEFT = left;
nd->nd_RIGHT = right;
1986-04-06 17:42:56 +00:00
return nd;
}
t_node *
dot2node(class, left, right)
t_node *left, *right;
{
return MkNode(class, left, right, &dot);
}
t_node *
1986-06-04 09:01:48 +00:00
MkLeaf(class, token)
t_token *token;
1986-06-04 09:01:48 +00:00
{
register t_node *nd = getnode(class);
nd->nd_token = *token;
switch(nsubnodes[class]) {
case 1:
nd->nd_NEXT = 0;
break;
case 2:
nd->nd_LEFT = 0;
nd->nd_RIGHT = 0;
break;
}
return nd;
1986-06-04 09:01:48 +00:00
}
t_node *
dot2leaf(class)
{
return MkLeaf(class, &dot);
}
1991-03-13 13:49:56 +00:00
FreeNode(nd)
1987-12-02 10:41:38 +00:00
register t_node *nd;
{
1991-03-13 13:49:56 +00:00
/* Put nodes that are no longer needed back onto the free
list
*/
if (!nd) return;
switch(nsubnodes[nd->nd_class]) {
case 2:
FreeNode(nd->nd_LEFT);
FreeNode(nd->nd_RIGHT);
break;
case 1:
FreeNode(nd->nd_NEXT);
break;
}
1986-04-06 17:42:56 +00:00
free_node(nd);
}
1986-04-07 17:40:38 +00:00
1986-06-17 12:04:05 +00:00
NodeCrash(expp)
t_node *expp;
1986-06-17 12:04:05 +00:00
{
crash("Illegal node %d", expp->nd_class);
}
PNodeCrash(expp)
t_node **expp;
{
crash("Illegal node %d", (*expp)->nd_class);
}
1986-04-07 17:40:38 +00:00
#ifdef DEBUG
extern char *symbol2str();
1986-06-26 09:39:36 +00:00
indnt(lvl)
1986-04-07 17:40:38 +00:00
{
1986-06-26 09:39:36 +00:00
while (lvl--) {
print(" ");
1986-04-07 17:40:38 +00:00
}
}
1986-06-26 09:39:36 +00:00
printnode(nd, lvl)
register t_node *nd;
1986-04-07 17:40:38 +00:00
{
1986-06-26 09:39:36 +00:00
indnt(lvl);
print("Class: %d; Symbol: %s; Flags: %d\n", nd->nd_class, symbol2str(nd->nd_symb), nd->nd_flags);
if (nd->nd_type) {
indnt(lvl);
print("Type: ");
DumpType(nd->nd_type);
print("\n");
}
1986-06-26 09:39:36 +00:00
}
PrNode(nd, lvl)
register t_node *nd;
1986-06-26 09:39:36 +00:00
{
if (! nd) {
indnt(lvl); print("<nilnode>\n");
return;
}
printnode(nd, lvl);
switch(nsubnodes[nd->nd_class]) {
case 1:
PrNode(nd->nd_LEFT, lvl + 1);
PrNode(nd->nd_RIGHT, lvl + 1);
break;
case 2:
PrNode(nd->nd_NEXT, lvl + 1);
break;
}
1986-04-07 17:40:38 +00:00
}
#endif DEBUG