/* Bytecode Interpreter utility to generate arity table.
   Copyright (C) 1993 Free Software Foundation, Inc.

This file is part of GNU CC.

GNU CC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU CC; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */


#include "bi-defs.h"

int
length (n)
     struct node *n;
{
  int k;

  for (k = 0; n; n = n->next)
    ++k;
  return k;
}

int
main ()
{
  struct def *d;
  struct variation *v;
  struct node *n;

  yyparse ();
  reverse ();

  for (d = defs; d; d = d->next)
    for (v = d->variations; v; v = v->next)
      {
	printf ("{ %d, %d, %d, {", length (v->inputs),
	       length (v->outputs), length (v->literals));
	for (n = v->literals; n; n = n->next)
	  printf ("%scode, ", n->text);
	if (v->literals == 0)
	  printf ("0");
	printf ("}},\n");
      }
  return 0;
}