parse.c revision 1.1 
1/*
2 * Copyright (c) 1983 Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35static char sccsid[] = "@(#)parse.c	5.3 (Berkeley) 6/1/90";
36#endif /* not lint */
37
38#include "externs.h"
39
40wordinit()
41{
42	register struct wlist *w;
43
44	for (w = wlist; w->string; w++)
45		install(w);
46}
47
48hash(s)
49	register char *s;
50{
51	register hashval = 0;
52
53	while (*s) {
54		hashval += *s++;
55		hashval *= HASHMUL;
56		hashval &= HASHMASK;
57	}
58	return hashval;
59}
60
61struct wlist *
62lookup(s)
63	char *s;
64{
65	register struct wlist *wp;
66
67	for (wp = hashtab[hash(s)]; wp != NULL; wp = wp->next)
68		if (*s == *wp->string && strcmp(s, wp->string) == 0)
69			return wp;
70	return NULL;
71}
72
73install(wp)
74	register struct wlist *wp;
75{
76	int hashval;
77
78	if (lookup(wp->string) == NULL) {
79		hashval = hash(wp->string);
80		wp->next = hashtab[hashval];
81		hashtab[hashval] = wp;
82	} else
83		printf("Multiply defined %s.\n", wp->string);
84}
85
86parse()
87{
88	register struct wlist *wp;
89	register n;
90
91	wordnumber = 0;           /* for cypher */
92	for (n = 0; n <= wordcount; n++) {
93		if ((wp = lookup(words[n])) == NULL) {
94			wordvalue[n] = -1;
95			wordtype[n] = -1;
96		} else {
97			wordvalue[n] = wp -> value;
98			wordtype[n] = wp -> article;
99		}
100	}
101}
102