Parser/listnode.c

   1 /***********************************************************
   2 Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam,
   3 The Netherlands.
   4
   5                         All Rights Reserved
   6
   7 Permission to use, copy, modify, and distribute this software and its
   8 documentation for any purpose and without fee is hereby granted,
   9 provided that the above copyright notice appear in all copies and that
  10 both that copyright notice and this permission notice appear in
  11 supporting documentation, and that the names of Stichting Mathematisch
  12 Centrum or CWI or Corporation for National Research Initiatives or
  13 CNRI not be used in advertising or publicity pertaining to
  14 distribution of the software without specific, written prior
  15 permission.
  16
  17 While CWI is the initial source for this software, a modified version
  18 is made available by the Corporation for National Research Initiatives
  19 (CNRI) at the Internet address ftp://ftp.python.org.
  20
  21 STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH
  22 REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
  23 MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH
  24 CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
  25 DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  26 PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  27 TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  28 PERFORMANCE OF THIS SOFTWARE.
  29
  30 ******************************************************************/
  31
  32 /* List a node on a file */
  33
  34 #include "pgenheaders.h"
  35 #include "token.h"
  36 #include "node.h"
  37
  38 /* Forward */
  39 static void list1node Py_PROTO((FILE *, node *));
  40 static void listnode Py_PROTO((FILE *, node *));
  41
  42 void
  43 PyNode_ListTree(n)
  44         node *n;
  45 {
  46         listnode(stdout, n);
  47 }
  48
  49 static int level, atbol;
  50
  51 static void
  52 listnode(fp, n)
  53         FILE *fp;
  54         node *n;
  55 {
  56         level = 0;
  57         atbol = 1;
  58         list1node(fp, n);
  59 }
  60
  61 static void
  62 list1node(fp, n)
  63         FILE *fp;
  64         node *n;
  65 {
  66         if (n == 0)
  67                 return;
  68         if (ISNONTERMINAL(TYPE(n))) {
  69                 int i;
  70                 for (i = 0; i < NCH(n); i++)
  71                         list1node(fp, CHILD(n, i));
  72         }
  73         else if (ISTERMINAL(TYPE(n))) {
  74                 switch (TYPE(n)) {
  75                 case INDENT:
  76                         ++level;
  77                         break;
  78                 case DEDENT:
  79                         --level;
  80                         break;
  81                 default:
  82                         if (atbol) {
  83                                 int i;
  84                                 for (i = 0; i < level; ++i)
  85                                         fprintf(fp, "\t");
  86                                 atbol = 0;
  87                         }
  88                         if (TYPE(n) == NEWLINE) {
  89                                 if (STR(n) != NULL)
  90                                         fprintf(fp, "%s", STR(n));
  91                                 fprintf(fp, "\n");
  92                                 atbol = 1;
  93                         }
  94                         else
  95                                 fprintf(fp, "%s ", STR(n));
  96                         break;
  97                 }
  98         }
  99         else
 100                 fprintf(fp, "? ");
 101 }