* src/lalr.h (LA): New macro to access to the variable LA.

[bison.git] / src / output.c

diff --git a/src/output.c b/src/output.c
index 17329c890ccc32138faf076683e3644a808b0b8b..8ae1cff91d7f95f7f5f9c959dc958b3d7afa2b72 100644 (file)
--- a/src/output.c
+++ b/src/output.c
@@ -94,7 +94,6 @@
 #include "obstack.h"
 #include "quotearg.h"
 #include "getargs.h"
 #include "obstack.h"
 #include "quotearg.h"
 #include "getargs.h"

-#include "xalloc.h"

 #include "files.h"
 #include "gram.h"
 #include "LR0.h"
 #include "files.h"
 #include "gram.h"
 #include "LR0.h"


@@ -103,41 +102,41 @@
 #include "lalr.h"
 #include "reader.h"
 #include "conflicts.h"
 #include "lalr.h"
 #include "reader.h"
 #include "conflicts.h"

-#include "macrotab.h"
+#include "muscle_tab.h"

 
 extern void berror PARAMS((const char *));
 
 static int nvectors;
 static int nentries;
 
 extern void berror PARAMS((const char *));
 
 static int nvectors;
 static int nentries;

-static short **froms;
-static short **tos;
-static short *tally;
-static short *width;
-static short *actrow;
-static short *state_count;
-static short *order;
-static short *base;
-static short *pos;
-static short *table;
-static short *check;
+static short **froms = NULL;
+static short **tos = NULL;
+static short *tally = NULL;
+static short *width = NULL;
+static short *actrow = NULL;
+static short *state_count = NULL;
+static short *order = NULL;
+static short *base = NULL;
+static short *pos = NULL;
+static short *table = NULL;
+static short *check = NULL;

 static int lowzero;
 static int high;
 
 static int lowzero;
 static int high;
 

-struct obstack macro_obstack;
+struct obstack muscle_obstack;

 struct obstack output_obstack;
 
 /* FIXME. */
 
 static inline void
 struct obstack output_obstack;
 
 /* FIXME. */
 
 static inline void

-output_table_data (struct obstack *oout, 
-                  short *table_data, 
-                  short first, 
-                  short begin, 
+output_table_data (struct obstack *oout,
+                  short *table_data,
+                  short first,
+                  short begin,

                   short end)
 {
   int i;
   int j = 1;
                   short end)
 {
   int i;
   int j = 1;

-  
+

   obstack_fgrow1 (oout, "%6d", first);
   for (i = begin; i < end; ++i)
     {
   obstack_fgrow1 (oout, "%6d", first);
   for (i = begin; i < end; ++i)
     {


@@ -158,19 +157,20 @@ output_table_data (struct obstack *oout,
 static void
 output_token_translations (void)
 {
 static void
 output_token_translations (void)
 {

-  output_table_data (&output_obstack, token_translations, 
+  output_table_data (&output_obstack, token_translations,

                     0, 1, max_user_token_number + 1);
                     0, 1, max_user_token_number + 1);

-  macro_insert ("translate", obstack_finish (&output_obstack));
+  muscle_insert ("translate", obstack_finish (&output_obstack));
+  XFREE (token_translations);

 }
 
 
 static void
 output_gram (void)
 {
 }
 
 
 static void
 output_gram (void)
 {

-  output_table_data (&output_obstack, rrhs, 
+  output_table_data (&output_obstack, rrhs,

                     0, 1, nrules + 1);
                     0, 1, nrules + 1);

-  macro_insert ("prhs", obstack_finish (&output_obstack));
-  
+  muscle_insert ("prhs", obstack_finish (&output_obstack));
+

   {
     size_t yyrhs_size = 1;
     short *yyrhs, *sp;
   {
     size_t yyrhs_size = 1;
     short *yyrhs, *sp;


@@ -183,9 +183,9 @@ output_gram (void)
     for (sp = ritem + 1, i = 1; *sp; ++sp, ++i)
       yyrhs[i] = *sp > 0 ? *sp : 0;
 
     for (sp = ritem + 1, i = 1; *sp; ++sp, ++i)
       yyrhs[i] = *sp > 0 ? *sp : 0;
 

-    output_table_data (&output_obstack, yyrhs, 
+    output_table_data (&output_obstack, yyrhs,

                       ritem[0], 1, yyrhs_size);
                       ritem[0], 1, yyrhs_size);

-    macro_insert ("rhs", obstack_finish (&output_obstack));
+    muscle_insert ("rhs", obstack_finish (&output_obstack));

 
     XFREE (yyrhs);
   }
 
     XFREE (yyrhs);
   }


@@ -200,9 +200,13 @@ output_gram (void)
 static void
 output_stos (void)
 {
 static void
 output_stos (void)
 {

-  output_table_data (&output_obstack, accessing_symbol, 
+  int i;
+  short *values = (short *) alloca (sizeof (short) * nstates);
+  for (i = 0; i < nstates; ++i)
+    values[i] = state_table[i].accessing_symbol;
+  output_table_data (&output_obstack, values,

                     0, 1, nstates);
                     0, 1, nstates);

-  macro_insert ("stos", obstack_finish (&output_obstack));
+  muscle_insert ("stos", obstack_finish (&output_obstack));

 }
 
 
 }
 
 


@@ -215,7 +219,7 @@ output_rule_data (void)
 
   output_table_data (&output_obstack, rline,
                     0, 1, nrules + 1);
 
   output_table_data (&output_obstack, rline,
                     0, 1, nrules + 1);

-  macro_insert ("rline", obstack_finish (&output_obstack));
+  muscle_insert ("rline", obstack_finish (&output_obstack));

 
   j = 0;
   for (i = 0; i < nsyms; i++)
 
   j = 0;
   for (i = 0; i < nsyms; i++)


@@ -267,17 +271,17 @@ output_rule_data (void)
 
   /* Finish table and store. */
   obstack_1grow (&output_obstack, 0);
 
   /* Finish table and store. */
   obstack_1grow (&output_obstack, 0);

-  macro_insert ("tname", obstack_finish (&output_obstack));
+  muscle_insert ("tname", obstack_finish (&output_obstack));

 
   /* Output YYTOKNUM. */
   output_table_data (&output_obstack, user_toknums,
                     0, 1, ntokens + 1);
 
   /* Output YYTOKNUM. */
   output_table_data (&output_obstack, user_toknums,
                     0, 1, ntokens + 1);

-  macro_insert ("toknum", obstack_finish (&output_obstack));
+  muscle_insert ("toknum", obstack_finish (&output_obstack));

 
   /* Output YYR1. */
 
   /* Output YYR1. */

-  output_table_data (&output_obstack, rlhs, 
+  output_table_data (&output_obstack, rlhs,

                     0, 1, nrules + 1);
                     0, 1, nrules + 1);

-  macro_insert ("r1", obstack_finish (&output_obstack));
+  muscle_insert ("r1", obstack_finish (&output_obstack));

   XFREE (rlhs + 1);
 
   /* Output YYR2. */
   XFREE (rlhs + 1);
 
   /* Output YYR2. */


@@ -285,9 +289,9 @@ output_rule_data (void)
   for (i = 1; i < nrules; i++)
     short_tab[i] = rrhs[i + 1] - rrhs[i] - 1;
   short_tab[nrules] = nitems - rrhs[nrules] - 1;
   for (i = 1; i < nrules; i++)
     short_tab[i] = rrhs[i + 1] - rrhs[i] - 1;
   short_tab[nrules] = nitems - rrhs[nrules] - 1;

-  output_table_data (&output_obstack, short_tab, 
+  output_table_data (&output_obstack, short_tab,

                     0, 1, nrules + 1);
                     0, 1, nrules + 1);

-  macro_insert ("r2", obstack_finish (&output_obstack));
+  muscle_insert ("r2", obstack_finish (&output_obstack));

   XFREE (short_tab);
 
   XFREE (rrhs + 1);
   XFREE (short_tab);
 
   XFREE (rrhs + 1);


@@ -334,7 +338,7 @@ action_row (int state)
 
   default_rule = 0;
   nreds = 0;
 
   default_rule = 0;
   nreds = 0;

-  redp = reduction_table[state];
+  redp = state_table[state].reduction_table;

 
   if (redp)
     {
 
   if (redp)
     {


@@ -344,13 +348,13 @@ action_row (int state)
        {
          /* loop over all the rules available here which require
             lookahead */
        {
          /* loop over all the rules available here which require
             lookahead */

-         m = lookaheads[state];
-         n = lookaheads[state + 1];
+         m = state_table[state].lookaheads;
+         n = state_table[state + 1].lookaheads;

 
          for (i = n - 1; i >= m; i--)
            {
              rule = -LAruleno[i];
 
          for (i = n - 1; i >= m; i--)
            {
              rule = -LAruleno[i];

-             wordp = LA + i * tokensetsize;
+             wordp = LA (i);

              mask = 1;
 
              /* and find each token which the rule finds acceptable
              mask = 1;
 
              /* and find each token which the rule finds acceptable


@@ -373,7 +377,7 @@ action_row (int state)
        }
     }
 
        }
     }
 

-  shiftp = shift_table[state];
+  shiftp = state_table[state].shift_table;

 
   /* Now see which tokens are allowed for shifts in this state.  For
      them, record the shift as the thing to do.  So shift is preferred
 
   /* Now see which tokens are allowed for shifts in this state.  For
      them, record the shift as the thing to do.  So shift is preferred


@@ -389,7 +393,7 @@ action_row (int state)
          if (!shift_state)
            continue;
 
          if (!shift_state)
            continue;
 

-         symbol = accessing_symbol[shift_state];
+         symbol = state_table[shift_state].accessing_symbol;

 
          if (ISVAR (symbol))
            break;
 
          if (ISVAR (symbol))
            break;


@@ -424,7 +428,7 @@ action_row (int state)
 
   if (nreds >= 1 && !nodefault)
     {
 
   if (nreds >= 1 && !nodefault)
     {

-      if (consistent[state])
+      if (state_table[state].consistent)

        default_rule = redp->rules[0];
       else
        {
        default_rule = redp->rules[0];
       else
        {


@@ -534,10 +538,10 @@ token_actions (void)
       save_row (i);
     }
 
       save_row (i);
     }
 

-  output_table_data (&output_obstack, yydefact, 
+  output_table_data (&output_obstack, yydefact,

                     yydefact[0], 1, nstates);
                     yydefact[0], 1, nstates);

-  macro_insert ("defact", obstack_finish (&output_obstack));
-  
+  muscle_insert ("defact", obstack_finish (&output_obstack));
+

   XFREE (actrow);
   XFREE (yydefact);
 }
   XFREE (actrow);
   XFREE (yydefact);
 }


@@ -548,8 +552,6 @@ free_shifts (void)
 {
   shifts *sp, *sptmp;  /* JF derefrenced freed ptr */
 
 {
   shifts *sp, *sptmp;  /* JF derefrenced freed ptr */
 

-  XFREE (shift_table);
-

   for (sp = first_shift; sp; sp = sptmp)
     {
       sptmp = sp->next;
   for (sp = first_shift; sp; sp = sptmp)
     {
       sptmp = sp->next;


@@ -563,8 +565,6 @@ free_reductions (void)
 {
   reductions *rp, *rptmp;      /* JF fixed freed ptr */
 
 {
   reductions *rp, *rptmp;      /* JF fixed freed ptr */
 

-  XFREE (reduction_table);
-

   for (rp = first_reduction; rp; rp = rptmp)
     {
       rptmp = rp->next;
   for (rp = first_reduction; rp; rp = rptmp)
     {
       rptmp = rp->next;


@@ -675,9 +675,9 @@ goto_actions (void)
       yydefgoto[i - ntokens] = default_state;
     }
 
       yydefgoto[i - ntokens] = default_state;
     }
 

-  output_table_data (&output_obstack, yydefgoto, 
+  output_table_data (&output_obstack, yydefgoto,

                     yydefgoto[0], 1, nsyms - ntokens);
                     yydefgoto[0], 1, nsyms - ntokens);

-  macro_insert ("defgoto", obstack_finish (&output_obstack));
+  muscle_insert ("defgoto", obstack_finish (&output_obstack));

 
   XFREE (state_count);
   XFREE (yydefgoto);
 
   XFREE (state_count);
   XFREE (yydefgoto);


@@ -880,14 +880,14 @@ static void
 output_base (void)
 {
   /* Output pact. */
 output_base (void)
 {
   /* Output pact. */

-  output_table_data (&output_obstack, base, 
+  output_table_data (&output_obstack, base,

                     base[0], 1, nstates);
                     base[0], 1, nstates);

-  macro_insert ("pact", obstack_finish (&output_obstack));
+  muscle_insert ("pact", obstack_finish (&output_obstack));

 
   /* Output pgoto. */
 
   /* Output pgoto. */

-  output_table_data (&output_obstack, base, 
+  output_table_data (&output_obstack, base,

                     base[nstates], nstates + 1, nvectors);
                     base[nstates], nstates + 1, nvectors);

-  macro_insert ("pgoto", obstack_finish (&output_obstack));
+  muscle_insert ("pgoto", obstack_finish (&output_obstack));

 
   XFREE (base);
 }
 
   XFREE (base);
 }


@@ -896,9 +896,9 @@ output_base (void)
 static void
 output_table (void)
 {
 static void
 output_table (void)
 {

-  output_table_data (&output_obstack, table, 
+  output_table_data (&output_obstack, table,

                     table[0], 1, high + 1);
                     table[0], 1, high + 1);

-  macro_insert ("table", obstack_finish (&output_obstack));
+  muscle_insert ("table", obstack_finish (&output_obstack));

   XFREE (table);
 }
 
   XFREE (table);
 }
 


@@ -906,9 +906,9 @@ output_table (void)
 static void
 output_check (void)
 {
 static void
 output_check (void)
 {

-  output_table_data (&output_obstack, check, 
+  output_table_data (&output_obstack, check,

                     check[0], 1, high + 1);
                     check[0], 1, high + 1);

-  macro_insert ("check", obstack_finish (&output_obstack));
+  muscle_insert ("check", obstack_finish (&output_obstack));

   XFREE (check);
 }
 
   XFREE (check);
 }
 


@@ -928,10 +928,8 @@ output_actions (void)
   token_actions ();
   free_shifts ();
   free_reductions ();
   token_actions ();
   free_shifts ();
   free_reductions ();

-  XFREE (lookaheads);

   XFREE (LA);
   XFREE (LAruleno);
   XFREE (LA);
   XFREE (LAruleno);

-  XFREE (accessing_symbol);

 
   goto_actions ();
   XFREE (goto_map + ntokens);
 
   goto_actions ();
   XFREE (goto_map + ntokens);


@@ -945,29 +943,23 @@ output_actions (void)
   output_table ();
 
   output_check ();
   output_table ();
 
   output_check ();

+  XFREE (state_table);

 }
 
 }
 

-/*------------------------------------------.
-| Copy the parser code into TABLE_OBSTACK.  |
-`------------------------------------------*/
+\f
+/*------------------------------------------------------------.
+| Copy the parser code from SKEL_FILENAME into OOUT obstack.  |
+| and do the muscle substitution.                             |
+`------------------------------------------------------------*/

 
 static void
 
 static void

-output_parser (void)
+output_parser (const char *skel_filename, struct obstack *oout)

 {
   int c;
   FILE *fskel;
   size_t line;
 {
   int c;
   FILE *fskel;
   size_t line;

-  int actions_dumped = 0;

 
 

-  /* Loop over lines in the standard parser file.  */
-  if (!skeleton)
-    {
-      if (semantic_parser)
-       skeleton = skeleton_find ("BISON_HAIRY", BISON_HAIRY);
-      else
-       skeleton = skeleton_find ("BISON_SIMPLE", BISON_SIMPLE);
-    }
-  fskel = xfopen (skeleton, "r");
+  fskel = xfopen (skel_filename, "r");

 
   /* New output code.  */
   line = 1;
 
   /* New output code.  */
   line = 1;


@@ -978,52 +970,65 @@ output_parser (void)
        {
          if (c == '\n')
            ++line;
        {
          if (c == '\n')
            ++line;

-         obstack_1grow (&table_obstack, c);
+         obstack_1grow (oout, c);

          c = getc (fskel);
        }
       else if ((c = getc (fskel)) == '%')
        {
          c = getc (fskel);
        }
       else if ((c = getc (fskel)) == '%')
        {

-         /* Read the macro.  */
-         const char *macro_key = 0;
-         const char *macro_value = 0;
+         /* Read the muscle.  */
+         const char *muscle_key = 0;
+         const char *muscle_value = 0;
+

          while (isalnum (c = getc (fskel)) || c == '_')
          while (isalnum (c = getc (fskel)) || c == '_')

-           obstack_1grow (&macro_obstack, c);
-         obstack_1grow (&macro_obstack, 0);
+           obstack_1grow (&muscle_obstack, c);
+         obstack_1grow (&muscle_obstack, 0);

 
          /* Output the right value, or see if it's something special.  */
 
          /* Output the right value, or see if it's something special.  */

-         macro_key = obstack_finish (&macro_obstack);
-         macro_value = macro_find (macro_key);
-         if (macro_value)
-           obstack_sgrow (&table_obstack, macro_value);
-         else if (!strcmp (macro_key, "line"))
-           obstack_fgrow1 (&table_obstack, "%d", line + 1);
-         else if (!strcmp (macro_key, "action"))
-           {
-             size_t size = obstack_object_size (&action_obstack);
-             obstack_grow (&table_obstack, 
-                           obstack_finish (&action_obstack), size);
-           }
+         muscle_key = obstack_finish (&muscle_obstack);
+         muscle_value = muscle_find (muscle_key);
+         if (muscle_value)
+           obstack_sgrow (oout, muscle_value);
+         else if (!strcmp (muscle_key, "line"))
+           obstack_fgrow1 (oout, "%d", line + 1);
+         else if (!strcmp (muscle_key, "input_line"))
+           obstack_fgrow1 (oout, "%d", lineno);
+         /* FIXME: Insert the code to recognize %%sub-skeleton for exemple.  */

          else
            {
          else
            {

-             obstack_sgrow (&table_obstack, "%%");
-             obstack_sgrow (&table_obstack, macro_key);
+             obstack_sgrow (oout, "%%");
+             obstack_sgrow (oout, muscle_key);

            }
        }
       else
            }
        }
       else

-       obstack_1grow (&table_obstack, '%');
+       obstack_1grow (oout, '%');

     }
 
   /* End.  */
   xfclose (fskel);
 }
 
     }
 
   /* End.  */
   xfclose (fskel);
 }
 

+/*----------------------------------------.
+| Prepare the master parser to be output  |
+`----------------------------------------*/
+
+static void
+output_master_parser (void)
+{
+  if (!skeleton)
+    {
+      if (semantic_parser)
+       skeleton = skeleton_find ("BISON_HAIRY", BISON_HAIRY);
+      else
+       skeleton = skeleton_find ("BISON_SIMPLE", BISON_SIMPLE);
+    }
+  output_parser (skeleton, &table_obstack);
+}
+
+

 static void
 free_itemsets (void)
 {
   core *cp, *cptmp;
 static void
 free_itemsets (void)
 {
   core *cp, *cptmp;

-
-  XFREE (state_table);
-

   for (cp = first_state; cp; cp = cptmp)
     {
       cptmp = cp->next;
   for (cp = first_state; cp; cp = cptmp)
     {
       cptmp = cp->next;


@@ -1033,49 +1038,52 @@ free_itemsets (void)
 
 /* FIXME. */
 
 
 /* FIXME. */
 

-#define MACRO_INSERT_INT(Key, Value)                   \
-{                                                      \
-  obstack_fgrow1 (&macro_obstack, "%d", Value);                \
-  obstack_1grow (&macro_obstack, 0);                   \
-  macro_insert (Key, obstack_finish (&macro_obstack)); \
+#define MUSCLE_INSERT_INT(Key, Value)                          \
+{                                                              \
+  obstack_fgrow1 (&muscle_obstack, "%d", Value);               \
+  obstack_1grow (&muscle_obstack, 0);                          \
+  muscle_insert (Key, obstack_finish (&muscle_obstack));       \

 }
 
 }
 

-#define MACRO_INSERT_STRING(Key, Value)                        \
-{                                                      \
-  obstack_sgrow (&macro_obstack, Value);               \
-  obstack_1grow (&macro_obstack, 0);                   \
-  macro_insert (Key, obstack_finish (&macro_obstack)); \
+#define MUSCLE_INSERT_STRING(Key, Value)                       \
+{                                                              \
+  obstack_sgrow (&muscle_obstack, Value);                      \
+  obstack_1grow (&muscle_obstack, 0);                          \
+  muscle_insert (Key, obstack_finish (&muscle_obstack));       \

 }
 
 }
 

-#define MACRO_INSERT_PREFIX(Key, Value)                                        \
+#define MUSCLE_INSERT_PREFIX(Key, Value)                               \

 {                                                                      \
 {                                                                      \

-  obstack_fgrow2 (&macro_obstack, "%s%s", spec_name_prefix, Value);    \
-  obstack_1grow (&macro_obstack, 0);                                   \
-  macro_insert (Key, obstack_finish (&macro_obstack));                 \
+  obstack_fgrow2 (&muscle_obstack, "%s%s", spec_name_prefix, Value);   \
+  obstack_1grow (&muscle_obstack, 0);                                  \
+  muscle_insert (Key, obstack_finish (&muscle_obstack));               \

 }
 
 static void
 prepare (void)
 {
 }
 
 static void
 prepare (void)
 {

-  MACRO_INSERT_INT ("last", high);
-  MACRO_INSERT_INT ("flag", MINSHORT);
-  MACRO_INSERT_INT ("pure", pure_parser);
-  MACRO_INSERT_INT ("nsym", nsyms);
-  MACRO_INSERT_INT ("debug", debug_flag);
-  MACRO_INSERT_INT ("final", final_state);
-  MACRO_INSERT_INT ("maxtok", max_user_token_number);
-  MACRO_INSERT_INT ("ntbase", ntokens);
-  MACRO_INSERT_INT ("verbose", 0);
-
-  MACRO_INSERT_STRING ("filename", infile);
-
-  MACRO_INSERT_INT ("nnts", nvars);
-  MACRO_INSERT_INT ("nrules", nrules);
-  MACRO_INSERT_INT ("nstates", nstates);
-  MACRO_INSERT_INT ("ntokens", ntokens);
+  MUSCLE_INSERT_INT ("last", high);
+  MUSCLE_INSERT_INT ("flag", MINSHORT);
+  MUSCLE_INSERT_INT ("pure", pure_parser);
+  MUSCLE_INSERT_INT ("nsym", nsyms);
+  MUSCLE_INSERT_INT ("debug", debug_flag);
+  MUSCLE_INSERT_INT ("final", final_state);
+  MUSCLE_INSERT_INT ("maxtok", max_user_token_number);
+  MUSCLE_INSERT_INT ("ntbase", ntokens);
+  MUSCLE_INSERT_INT ("verbose", 0);
+
+  MUSCLE_INSERT_INT ("nnts", nvars);
+  MUSCLE_INSERT_INT ("nrules", nrules);
+  MUSCLE_INSERT_INT ("nstates", nstates);
+  MUSCLE_INSERT_INT ("ntokens", ntokens);
+
+  MUSCLE_INSERT_INT ("locations_flag", locations_flag);
+
+  /* We need to save the actions in the muscle %%action.  */
+  muscle_insert ("action", obstack_finish (&action_obstack));

 
   if (spec_name_prefix)
 
   if (spec_name_prefix)

-    MACRO_INSERT_STRING ("prefix", spec_name_prefix);
+    MUSCLE_INSERT_STRING ("prefix", spec_name_prefix);

 }
 
 /*----------------------------------------------------------.
 }
 
 /*----------------------------------------------------------.


@@ -1087,9 +1095,6 @@ output (void)
 {
   obstack_init (&output_obstack);
 
 {
   obstack_init (&output_obstack);
 

-#if 0
-  reader_output_yylsp (&table_obstack); */
-#endif

   free_itemsets ();
 
   output_token_translations ();
   free_itemsets ();
 
   output_token_translations ();


@@ -1099,16 +1104,19 @@ output (void)
   if (semantic_parser)
     output_stos ();
   output_rule_data ();
   if (semantic_parser)
     output_stos ();
   output_rule_data ();

+  XFREE (user_toknums);

   output_actions ();
   output_actions ();

-  
+

 #if 0
   if (!no_parser_flag) */
 #endif
   prepare ();
   /* Copy definitions in directive.  */
 #if 0
   if (!no_parser_flag) */
 #endif
   prepare ();
   /* Copy definitions in directive.  */

-  macro_insert ("prologue", obstack_finish (&attrs_obstack));
-  output_parser ();
+  muscle_insert ("prologue", obstack_finish (&attrs_obstack));
+
+  output_master_parser ();

 
 

-  obstack_free (&macro_obstack, 0);
+  obstack_free (&muscle_obstack, 0);

   obstack_free (&output_obstack, 0);
   obstack_free (&output_obstack, 0);

+  obstack_free (&action_obstack, 0);

 }
 }