xref: /openbsd/games/boggle/mkdict/mkdict.c (revision 7b36286a)
1 /*	$OpenBSD: mkdict.c,v 1.10 2006/04/11 09:17:55 deraadt Exp $	*/
2 /*	$NetBSD: mkdict.c,v 1.2 1995/03/21 12:14:49 cgd Exp $	*/
3 
4 /*-
5  * Copyright (c) 1993
6  *	The Regents of the University of California.  All rights reserved.
7  *
8  * This code is derived from software contributed to Berkeley by
9  * Barry Brachman.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #ifndef lint
37 static char copyright[] =
38 "@(#) Copyright (c) 1993\n\
39 	The Regents of the University of California.  All rights reserved.\n";
40 #endif /* not lint */
41 
42 #ifndef lint
43 #if 0
44 static char sccsid[] = "@(#)mkdict.c	8.1 (Berkeley) 6/11/93";
45 #else
46 static char rcsid[] = "$OpenBSD: mkdict.c,v 1.10 2006/04/11 09:17:55 deraadt Exp $";
47 #endif
48 #endif /* not lint */
49 
50 /*
51  * Filter out words that:
52  *	1) Are not completely made up of lower case letters
53  *	2) Contain a 'q' not immediately followed by a 'u'
54  *	3) Are less than 3 characters long
55  *	4) Are greater than MAXWORDLEN characters long
56  */
57 
58 #include <ctype.h>
59 #include <err.h>
60 #include <stdio.h>
61 #include <stdlib.h>
62 #include <limits.h>
63 #include <string.h>
64 
65 #include "bog.h"
66 
67 int
68 main(int argc, char *argv[])
69 {
70 	char *p, *q;
71 	const char *errstr;
72 	int ch, common, n, nwords;
73 	int current, len, prev, qcount;
74 	char buf[2][MAXWORDLEN + 1];
75 
76 	prev = 0;
77 	current = 1;
78 	buf[prev][0] = '\0';
79 	if (argc == 2) {
80 		n = strtonum(argv[1], 1, INT_MAX, &errstr);
81 		if (errstr)
82 			errx(1, "%s: %s", argv[1], errstr);
83 	}
84 
85 	for (nwords = 1;
86 	    fgets(buf[current], MAXWORDLEN + 1, stdin) != NULL; ++nwords) {
87 		if ((p = strchr(buf[current], '\n')) == NULL) {
88 			warnx("word too long: %s", buf[current]);
89 			while ((ch = getc(stdin)) != EOF && ch != '\n')
90 				;
91 			if (ch == EOF)
92 				break;
93 			continue;
94 		}
95 		len = 0;
96 		for (p = buf[current]; *p != '\n'; p++) {
97 			if (!islower(*p))
98 				break;
99 			if (*p == 'q') {
100 				q = p + 1;
101 				if (*q != 'u')
102 					break;
103 				else {
104 					while ((*q = *(q + 1)))
105 						q++;
106 				}
107 				len++;
108 			}
109 			len++;
110 		}
111 		if (*p != '\n' || len < 3 || len > MAXWORDLEN)
112 			continue;
113 		if (argc == 2 && nwords % n)
114 			continue;
115 
116 		*p = '\0';
117 		p = buf[current];
118 		q = buf[prev];
119 		qcount = 0;
120 		while ((ch = *p++) == *q++ && ch != '\0')
121 			if (ch == 'q')
122 				qcount++;
123 		common = p - buf[current] - 1;
124 		printf("%c%s", common + qcount, p - 1);
125 		prev = !prev;
126 		current = !current;
127 	}
128 	warnx("%d words", nwords);
129 	exit(0);
130 }
131