/* * Copyright (c) 1983 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that: (1) source distributions retain this entire copyright * notice and comment, and (2) distributions including binaries display * the following acknowledgement: ``This product includes software * developed by the University of California, Berkeley and its contributors'' * in the documentation or other materials provided with the distribution * and in all advertising materials mentioning features or use of this * software. Neither the name of the University nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. */ #ifndef lint static char sccsid[] = "@(#)parse.c 5.3 (Berkeley) 6/1/90"; #endif /* not lint */ #include "externs.h" wordinit() { register struct wlist *w; for (w = wlist; w->string; w++) install(w); } hash(s) register char *s; { register hashval = 0; while (*s) { hashval += *s++; hashval *= HASHMUL; hashval &= HASHMASK; } return hashval; } struct wlist * lookup(s) char *s; { register struct wlist *wp; for (wp = hashtab[hash(s)]; wp != NULL; wp = wp->next) if (*s == *wp->string && strcmp(s, wp->string) == 0) return wp; return NULL; } install(wp) register struct wlist *wp; { int hashval; if (lookup(wp->string) == NULL) { hashval = hash(wp->string); wp->next = hashtab[hashval]; hashtab[hashval] = wp; } else printf("Multiply defined %s.\n", wp->string); } parse() { register struct wlist *wp; register n; 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; } } }