`existent', not `existant'

[bsdgames-darwin.git] / battlestar / parse.c

diff --git a/battlestar/parse.c b/battlestar/parse.c
index 4a4919b711507222e4d6c35681aa6cc57f39556d..4470366590e850fc69162978d75f1acd721de963 100644 (file)
--- a/battlestar/parse.c
+++ b/battlestar/parse.c
@@ -1,6 +1,8 @@
+/*     $NetBSD: parse.c,v 1.12 2001/06/19 13:42:09 wiz Exp $   */
+
 /*
- * Copyright (c) 1983 Regents of the University of California.
- * All rights reserved.
+ * Copyright (c) 1983, 1993
+ *     The Regents of the University of California.  All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
@@ -31,25 +33,41 @@
  * SUCH DAMAGE.
  */
 
+#include <sys/cdefs.h>
 #ifndef lint
-/*static char sccsid[] = "from: @(#)parse.c    5.3 (Berkeley) 6/1/90";*/
-static char rcsid[] = "$Id: parse.c,v 1.2 1993/08/01 18:55:53 mycroft Exp $";
-#endif /* not lint */
+#if 0
+static char sccsid[] = "@(#)parse.c    8.2 (Berkeley) 4/28/95";
+#else
+__RCSID("$NetBSD: parse.c,v 1.12 2001/06/19 13:42:09 wiz Exp $");
+#endif
+#endif                         /* not lint */
+
+#include "extern.h"
+
+#define HASHSIZE       256
+#define HASHMUL                81
+#define HASHMASK       (HASHSIZE - 1)
 
-#include "externs.h"
+static int hash __P((const char *));
+static void install __P((struct wlist *));
+static struct wlist *lookup __P((const char *));
 
+static struct wlist *hashtab[HASHSIZE];
+
+void
 wordinit()
 {
-       register struct wlist *w;
+       struct wlist *w;
 
        for (w = wlist; w->string; w++)
                install(w);
 }
 
+static int
 hash(s)
-       register char *s;
+       const char   *s;
 {
-       register hashval = 0;
+       int     hashval = 0;
 
        while (*s) {
                hashval += *s++;
@@ -59,11 +77,11 @@ hash(s)
        return hashval;
 }
 
-struct wlist *
+static struct wlist *
 lookup(s)
-       char *s;
+       const char   *s;
 {
-       register struct wlist *wp;
+       struct wlist *wp;
 
        for (wp = hashtab[hash(s)]; wp != NULL; wp = wp->next)
                if (*s == *wp->string && strcmp(s, wp->string) == 0)
@@ -71,10 +89,11 @@ lookup(s)
        return NULL;
 }
 
+static void
 install(wp)
-       register struct wlist *wp;
+       struct wlist *wp;
 {
-       int hashval;
+       int     hashval;
 
        if (lookup(wp->string) == NULL) {
                hashval = hash(wp->string);
@@ -84,19 +103,89 @@ install(wp)
                printf("Multiply defined %s.\n", wp->string);
 }
 
+void
 parse()
 {
-       register struct wlist *wp;
-       register n;
+       struct wlist *wp;
+       int     n;
+       int     flag;
 
-       wordnumber = 0;           /* for cypher */
+       wordnumber = 0;         /* for cypher */
        for (n = 0; n <= wordcount; n++) {
                if ((wp = lookup(words[n])) == NULL) {
                        wordvalue[n] = -1;
                        wordtype[n] = -1;
                } else {
-                       wordvalue[n] = wp -> value;
-                       wordtype[n] = wp -> article;
+                       wordvalue[n] = wp->value;
+                       wordtype[n] = wp->article;
+               }
+       }
+       /* We never use adjectives for anything, so yank them all. */
+       for (n = 1; n < wordcount; n++)
+               if (wordtype[n] == ADJS) {
+                       int i;
+                       for (i = n + 1; i < wordcount; i++) {
+                               wordtype[i - 1] = wordtype[i];
+                               wordvalue[i - 1] = wordvalue[i];
+                               strcpy(words[i - 1], words[i]);
+                       }
+                       wordcount--;
+               }
+       /* Don't let a comma mean AND if followed by a verb. */
+       for (n = 0; n < wordcount; n++)
+               if (wordvalue[n] == AND && words[n][0] == ','
+                   && wordtype[n + 1] == VERB) {
+                       wordvalue[n] = -1;
+                       wordtype[n] = -1;
+               }
+       /* Trim "AND AND" which can happen naturally at the end of a
+        * comma-delimited list.
+        */
+       for (n = 1; n < wordcount; n++)
+               if (wordvalue[n - 1] == AND && wordvalue[n] == AND) {
+                       int i;
+                       for (i = n + 1; i < wordcount; i++) {
+                               wordtype[i - 1] = wordtype[i];
+                               wordvalue[i - 1] = wordvalue[i];
+                               strcpy(words[i - 1], words[i]);
+                       }
+                       wordcount--;
+               }
+
+       /* If there is a sequence (NOUN | OBJECT) AND EVERYTHING
+        * then move all the EVERYTHINGs to the beginning, since that's where
+        * they're expected.  We can't get rid of the NOUNs and OBJECTs in
+        * case they aren't in EVERYTHING (i.e. not here or nonexistent).
+        */
+       flag = 1;
+       while (flag) {
+               flag = 0;
+               for (n = 1; n < wordcount; n++)
+                       if ((wordtype[n - 1] == NOUNS || wordtype[n - 1] == OBJECT) &&
+                           wordvalue[n] == AND && wordvalue[n + 1] == EVERYTHING) {
+                               char tmpword[WORDLEN];
+                               wordvalue[n + 1] = wordvalue[n - 1];
+                               wordvalue[n - 1] = EVERYTHING;
+                               wordtype[n + 1] = wordtype[n - 1];
+                               wordtype[n - 1] = OBJECT;
+                               strcpy(tmpword, words[n - 1]);
+                               strcpy(words[n - 1], words[n + 1]);
+                               strcpy(words[n + 1], tmpword);
+                               flag = 1;
                }
+               /* And trim EVERYTHING AND EVERYTHING. */
+               for (n = 1; n < wordcount; n++)
+                       if (wordvalue[n - 1] == EVERYTHING &&
+                           wordvalue[n] == AND && wordvalue[n + 1] == EVERYTHING) {
+                               int i;
+                               for (i = n + 1; i < wordcount; i++) {
+                                       wordtype[i - 1] = wordtype[i + 1];
+                                       wordvalue[i - 1] = wordvalue[i + 1];
+                                       strcpy(words[i - 1], words[i + 1]);
+                               }
+                               wordcount--;
+                               wordcount--;
+                               flag = 1;
+                       }
        }
 }