* src/skeleton.h: New.

[bison.git] / src / nullable.c

diff --git a/src/nullable.c b/src/nullable.c
index c207924dc8328a9770263d2313451c8e38b66748..f8c9b32e5cf523b36742cb375ef0a087188ce2be 100644 (file)
--- a/src/nullable.c
+++ b/src/nullable.c
@@ -25,9 +25,10 @@
 
 #include "system.h"
 #include "getargs.h"
 
 #include "system.h"
 #include "getargs.h"

-#include "reader.h"
+#include "symtab.h"

 #include "types.h"
 #include "gram.h"
 #include "types.h"
 #include "gram.h"

+#include "reduce.h"

 #include "nullable.h"
 
 char *nullable = NULL;
 #include "nullable.h"
 
 char *nullable = NULL;


@@ -38,94 +39,82 @@ nullable_print (FILE *out)
   int i;
   fputs ("NULLABLE\n", out);
   for (i = ntokens; i < nsyms; i++)
   int i;
   fputs ("NULLABLE\n", out);
   for (i = ntokens; i < nsyms; i++)

-    fprintf (out, "\t%s: %s\n", tags[i], nullable[i] ? "yes" : "no");
+    fprintf (out, "\t%s: %s\n", symbols[i]->tag, nullable[i] ? "yes" : "no");

   fputs ("\n\n", out);
 }
 
 void
 set_nullable (void)
 {
   fputs ("\n\n", out);
 }
 
 void
 set_nullable (void)
 {

-  short *r;
+  int ruleno;

   short *s1;
   short *s2;
   shorts *p;
 
   short *s1;
   short *s2;
   shorts *p;
 

-  short *squeue;
-  short *rcount;
-  shorts **rsets;
-  shorts *relts;
+  short *squeue = XCALLOC (short, nvars);
+  short *rcount = XCALLOC (short, nrules + 1);
+  /* RITEM contains all the rules, including useless productions.
+     Hence we must allocate room for useless nonterminals too.  */
+  shorts **rsets = XCALLOC (shorts *, nvars) - ntokens;
+  /* This is said to be more elements than we actually use.
+     Supposedly NRITEMS - NRULES is enough.  But why take the risk?  */
+  shorts *relts = XCALLOC (shorts, nritems + nvars + 1);

 
   if (trace_flag)
     fprintf (stderr, "Entering set_nullable\n");
 
   nullable = XCALLOC (char, nvars) - ntokens;
 
 
   if (trace_flag)
     fprintf (stderr, "Entering set_nullable\n");
 
   nullable = XCALLOC (char, nvars) - ntokens;
 

-  squeue = XCALLOC (short, nvars);

   s1 = s2 = squeue;
   s1 = s2 = squeue;

-
-  rcount = XCALLOC (short, nrules + 1);
-  rsets = XCALLOC (shorts *, nvars) - ntokens;
-  /* This is said to be more elements than we actually use.
-     Supposedly nitems - nrules is enough.
-     But why take the risk?  */
-  relts = XCALLOC (shorts, nitems + nvars + 1);

   p = relts;
 
   p = relts;
 

-  r = ritem;
-  while (*r)
-    {
-      if (*r < 0)
-       {
-         int symbol = rule_table[-(*r++)].lhs;
-         if (symbol >= 0 && !nullable[symbol])
-           {
-             nullable[symbol] = 1;
-             *s2++ = symbol;
-           }
-       }
-      else
-       {
-         int any_tokens = 0;
-         int symbol;
-         short *r1 = r;
-         for (symbol = *r++; symbol > 0; symbol = *r++)
-           if (ISTOKEN (symbol))
-             any_tokens = 1;
-
-         if (!any_tokens)
-           {
-             int ruleno = -symbol;
-             r = r1;
-             for (symbol = *r++; symbol > 0; symbol = *r++)
+  for (ruleno = 1; ruleno < nrules + 1; ++ruleno)
+    if (rules[ruleno].useful)
+      {
+       if (ritem[rules[ruleno].rhs] >= 0)
+         {
+           /* This rule has a non empty RHS. */
+           short *r;
+           int any_tokens = 0;
+           for (r = &ritem[rules[ruleno].rhs]; *r >= 0; ++r)
+             if (ISTOKEN (*r))
+               any_tokens = 1;
+
+           /* This rule has only nonterminals: schedule it for the second
+              pass.  */
+           if (!any_tokens)
+             for (r = &ritem[rules[ruleno].rhs]; *r >= 0; ++r)

                {
                  rcount[ruleno]++;
                {
                  rcount[ruleno]++;

-                 p->next = rsets[symbol];
+                 p->next = rsets[*r];

                  p->value = ruleno;
                  p->value = ruleno;

-                 rsets[symbol] = p;
+                 rsets[*r] = p;

                  p++;
                }
                  p++;
                }

-           }
-       }
-    }
+         }
+       else
+         {
+           /* This rule has an empty RHS. */
+           assert (ritem[rules[ruleno].rhs] == -ruleno);
+           if (rules[ruleno].useful && !nullable[rules[ruleno].lhs])
+             {
+               nullable[rules[ruleno].lhs] = 1;
+               *s2++ = rules[ruleno].lhs;
+             }
+         }
+      }

 
   while (s1 < s2)
 
   while (s1 < s2)

-    {
-      p = rsets[*s1++];
-      while (p)
-       {
-         int ruleno = p->value;
-         p = p->next;
-         if (--rcount[ruleno] == 0)
+    for (p = rsets[*s1++]; p; p = p->next)
+      {
+       ruleno = p->value;
+       if (--rcount[ruleno] == 0)
+         if (rules[ruleno].useful && !nullable[rules[ruleno].lhs])

            {
            {

-             int symbol = rule_table[ruleno].lhs;
-             if (symbol >= 0 && !nullable[symbol])
-               {
-                 nullable[symbol] = 1;
-                 *s2++ = symbol;
-               }
+             nullable[rules[ruleno].lhs] = 1;
+             *s2++ = rules[ruleno].lhs;

            }
            }

-       }
-    }
+      }

 
   XFREE (squeue);
   XFREE (rcount);
 
   XFREE (squeue);
   XFREE (rcount);