cpython/Parser/listnode.c

76 lines
1.4 KiB
C
Raw Normal View History

1991-02-19 08:39:46 -04:00
/***********************************************************
2000-06-30 20:50:40 -03:00
Copyright (c) 2000, BeOpen.com.
Copyright (c) 1995-2000, Corporation for National Research Initiatives.
Copyright (c) 1990-1995, Stichting Mathematisch Centrum.
All rights reserved.
1991-02-19 08:39:46 -04:00
2000-06-30 20:50:40 -03:00
See the file "Misc/COPYRIGHT" for information on usage and
redistribution of this file, and for a DISCLAIMER OF ALL WARRANTIES.
1991-02-19 08:39:46 -04:00
******************************************************************/
1990-10-14 09:07:46 -03:00
/* List a node on a file */
1990-12-20 11:06:42 -04:00
#include "pgenheaders.h"
1990-10-14 09:07:46 -03:00
#include "token.h"
#include "node.h"
1990-12-20 11:06:42 -04:00
/* Forward */
static void list1node(FILE *, node *);
static void listnode(FILE *, node *);
1990-12-20 11:06:42 -04:00
void
PyNode_ListTree(node *n)
1990-12-20 11:06:42 -04:00
{
listnode(stdout, n);
}
1990-10-14 09:07:46 -03:00
static int level, atbol;
static void
listnode(FILE *fp, node *n)
1990-12-20 11:06:42 -04:00
{
level = 0;
atbol = 1;
list1node(fp, n);
}
1990-10-14 09:07:46 -03:00
static void
list1node(FILE *fp, node *n)
1990-10-14 09:07:46 -03:00
{
if (n == 0)
return;
if (ISNONTERMINAL(TYPE(n))) {
int i;
for (i = 0; i < NCH(n); i++)
list1node(fp, CHILD(n, i));
}
else if (ISTERMINAL(TYPE(n))) {
switch (TYPE(n)) {
case INDENT:
++level;
break;
case DEDENT:
--level;
break;
default:
if (atbol) {
int i;
for (i = 0; i < level; ++i)
fprintf(fp, "\t");
atbol = 0;
}
if (TYPE(n) == NEWLINE) {
if (STR(n) != NULL)
fprintf(fp, "%s", STR(n));
fprintf(fp, "\n");
atbol = 1;
}
else
fprintf(fp, "%s ", STR(n));
break;
}
}
else
fprintf(fp, "? ");
}