quiz.c revision 1.11 1 1.11 mycroft /* $NetBSD: quiz.c,v 1.11 1997/07/06 11:19:16 mycroft Exp $ */
2 1.9 cgd
3 1.1 cgd /*-
4 1.7 cgd * Copyright (c) 1991, 1993
5 1.7 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.7 cgd * Jim R. Oldroyd at The Instruction Set and Keith Gabryelski at
9 1.7 cgd * Commodore Business Machines.
10 1.1 cgd *
11 1.1 cgd * Redistribution and use in source and binary forms, with or without
12 1.1 cgd * modification, are permitted provided that the following conditions
13 1.1 cgd * are met:
14 1.1 cgd * 1. Redistributions of source code must retain the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer.
16 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 cgd * notice, this list of conditions and the following disclaimer in the
18 1.1 cgd * documentation and/or other materials provided with the distribution.
19 1.1 cgd * 3. All advertising materials mentioning features or use of this software
20 1.1 cgd * must display the following acknowledgement:
21 1.1 cgd * This product includes software developed by the University of
22 1.1 cgd * California, Berkeley and its contributors.
23 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
24 1.1 cgd * may be used to endorse or promote products derived from this software
25 1.1 cgd * without specific prior written permission.
26 1.1 cgd *
27 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 1.1 cgd * SUCH DAMAGE.
38 1.1 cgd */
39 1.1 cgd
40 1.1 cgd #ifndef lint
41 1.7 cgd static char copyright[] =
42 1.7 cgd "@(#) Copyright (c) 1991, 1993\n\
43 1.7 cgd The Regents of the University of California. All rights reserved.\n";
44 1.1 cgd #endif /* not lint */
45 1.1 cgd
46 1.1 cgd #ifndef lint
47 1.9 cgd #if 0
48 1.10 tls static char sccsid[] = "@(#)quiz.c 8.3 (Berkeley) 5/4/95";
49 1.9 cgd #else
50 1.11 mycroft static char rcsid[] = "$NetBSD: quiz.c,v 1.11 1997/07/06 11:19:16 mycroft Exp $";
51 1.9 cgd #endif
52 1.1 cgd #endif /* not lint */
53 1.1 cgd
54 1.1 cgd #include <sys/types.h>
55 1.10 tls
56 1.10 tls #include <ctype.h>
57 1.1 cgd #include <errno.h>
58 1.1 cgd #include <stdio.h>
59 1.1 cgd #include <stdlib.h>
60 1.1 cgd #include <string.h>
61 1.1 cgd #include <ctype.h>
62 1.6 pk #include <err.h>
63 1.10 tls #include <time.h>
64 1.10 tls #include <unistd.h>
65 1.1 cgd #include "quiz.h"
66 1.1 cgd #include "pathnames.h"
67 1.1 cgd
68 1.1 cgd static QE qlist;
69 1.1 cgd static int catone, cattwo, tflag;
70 1.1 cgd static u_int qsize;
71 1.1 cgd
72 1.7 cgd char *appdstr __P((char *, char *, size_t));
73 1.1 cgd void downcase __P((char *));
74 1.1 cgd void get_cats __P((char *, char *));
75 1.1 cgd void get_file __P((char *));
76 1.1 cgd char *next_cat __P((char *));
77 1.1 cgd void quiz __P((void));
78 1.1 cgd void score __P((u_int, u_int, u_int));
79 1.1 cgd void show_index __P((void));
80 1.1 cgd void usage __P((void));
81 1.1 cgd
82 1.1 cgd int
83 1.1 cgd main(argc, argv)
84 1.1 cgd int argc;
85 1.1 cgd char *argv[];
86 1.1 cgd {
87 1.1 cgd register int ch;
88 1.1 cgd char *indexfile;
89 1.1 cgd
90 1.1 cgd indexfile = _PATH_QUIZIDX;
91 1.1 cgd while ((ch = getopt(argc, argv, "i:t")) != EOF)
92 1.1 cgd switch(ch) {
93 1.1 cgd case 'i':
94 1.1 cgd indexfile = optarg;
95 1.1 cgd break;
96 1.1 cgd case 't':
97 1.1 cgd tflag = 1;
98 1.1 cgd break;
99 1.1 cgd case '?':
100 1.1 cgd default:
101 1.1 cgd usage();
102 1.1 cgd }
103 1.1 cgd argc -= optind;
104 1.1 cgd argv += optind;
105 1.1 cgd
106 1.1 cgd switch(argc) {
107 1.1 cgd case 0:
108 1.1 cgd get_file(indexfile);
109 1.1 cgd show_index();
110 1.1 cgd break;
111 1.1 cgd case 2:
112 1.1 cgd get_file(indexfile);
113 1.1 cgd get_cats(argv[0], argv[1]);
114 1.1 cgd quiz();
115 1.1 cgd break;
116 1.1 cgd default:
117 1.1 cgd usage();
118 1.1 cgd }
119 1.1 cgd exit(0);
120 1.1 cgd }
121 1.1 cgd
122 1.1 cgd void
123 1.1 cgd get_file(file)
124 1.1 cgd char *file;
125 1.1 cgd {
126 1.1 cgd register FILE *fp;
127 1.1 cgd register QE *qp;
128 1.1 cgd size_t len;
129 1.1 cgd char *lp;
130 1.1 cgd
131 1.1 cgd if ((fp = fopen(file, "r")) == NULL)
132 1.6 pk err(1, "%s", file);
133 1.1 cgd
134 1.1 cgd /*
135 1.1 cgd * XXX
136 1.1 cgd * Should really free up space from any earlier read list
137 1.1 cgd * but there are no reverse pointers to do so with.
138 1.1 cgd */
139 1.1 cgd qp = &qlist;
140 1.1 cgd qsize = 0;
141 1.5 cgd while ((lp = fgetln(fp, &len)) != NULL) {
142 1.8 cgd lp[--len] = '\0';
143 1.7 cgd if (qp->q_text && qp->q_text[strlen(qp->q_text) - 1] == '\\')
144 1.7 cgd qp->q_text = appdstr(qp->q_text, lp, len);
145 1.7 cgd else {
146 1.1 cgd if ((qp->q_next = malloc(sizeof(QE))) == NULL)
147 1.6 pk err(1, NULL);
148 1.1 cgd qp = qp->q_next;
149 1.1 cgd if ((qp->q_text = strdup(lp)) == NULL)
150 1.6 pk err(1, NULL);
151 1.1 cgd qp->q_asked = qp->q_answered = FALSE;
152 1.1 cgd qp->q_next = NULL;
153 1.1 cgd ++qsize;
154 1.1 cgd }
155 1.1 cgd }
156 1.1 cgd (void)fclose(fp);
157 1.1 cgd }
158 1.1 cgd
159 1.1 cgd void
160 1.1 cgd show_index()
161 1.1 cgd {
162 1.1 cgd register QE *qp;
163 1.1 cgd register char *p, *s;
164 1.1 cgd FILE *pf;
165 1.1 cgd
166 1.1 cgd if ((pf = popen(_PATH_PAGER, "w")) == NULL)
167 1.6 pk err(1, "%s", _PATH_PAGER);
168 1.1 cgd (void)fprintf(pf, "Subjects:\n\n");
169 1.1 cgd for (qp = qlist.q_next; qp; qp = qp->q_next) {
170 1.1 cgd for (s = next_cat(qp->q_text); s; s = next_cat(s)) {
171 1.1 cgd if (!rxp_compile(s))
172 1.6 pk errx(1, "%s", rxperr);
173 1.1 cgd if (p = rxp_expand())
174 1.1 cgd (void)fprintf(pf, "%s ", p);
175 1.1 cgd }
176 1.1 cgd (void)fprintf(pf, "\n");
177 1.1 cgd }
178 1.1 cgd (void)fprintf(pf, "\n%s\n%s\n%s\n",
179 1.1 cgd "For example, \"quiz victim killer\" prints a victim's name and you reply",
180 1.1 cgd "with the killer, and \"quiz killer victim\" works the other way around.",
181 1.1 cgd "Type an empty line to get the correct answer.");
182 1.1 cgd (void)pclose(pf);
183 1.1 cgd }
184 1.1 cgd
185 1.1 cgd void
186 1.1 cgd get_cats(cat1, cat2)
187 1.1 cgd char *cat1, *cat2;
188 1.1 cgd {
189 1.1 cgd register QE *qp;
190 1.1 cgd int i;
191 1.1 cgd char *s;
192 1.1 cgd
193 1.1 cgd downcase(cat1);
194 1.1 cgd downcase(cat2);
195 1.1 cgd for (qp = qlist.q_next; qp; qp = qp->q_next) {
196 1.1 cgd s = next_cat(qp->q_text);
197 1.1 cgd catone = cattwo = i = 0;
198 1.1 cgd while (s) {
199 1.1 cgd if (!rxp_compile(s))
200 1.6 pk errx(1, "%s", rxperr);
201 1.1 cgd i++;
202 1.1 cgd if (rxp_match(cat1))
203 1.1 cgd catone = i;
204 1.1 cgd if (rxp_match(cat2))
205 1.1 cgd cattwo = i;
206 1.1 cgd s = next_cat(s);
207 1.1 cgd }
208 1.1 cgd if (catone && cattwo && catone != cattwo) {
209 1.1 cgd if (!rxp_compile(qp->q_text))
210 1.6 pk errx(1, "%s", rxperr);
211 1.1 cgd get_file(rxp_expand());
212 1.1 cgd return;
213 1.1 cgd }
214 1.1 cgd }
215 1.6 pk errx(1, "invalid categories");
216 1.1 cgd }
217 1.1 cgd
218 1.1 cgd void
219 1.1 cgd quiz()
220 1.1 cgd {
221 1.1 cgd register QE *qp;
222 1.1 cgd register int i;
223 1.7 cgd size_t len;
224 1.1 cgd u_int guesses, rights, wrongs;
225 1.7 cgd int next;
226 1.7 cgd char *answer, *s, *t, question[LINE_SZ];
227 1.1 cgd
228 1.1 cgd srandom(time(NULL));
229 1.1 cgd guesses = rights = wrongs = 0;
230 1.1 cgd for (;;) {
231 1.1 cgd if (qsize == 0)
232 1.1 cgd break;
233 1.1 cgd next = random() % qsize;
234 1.1 cgd qp = qlist.q_next;
235 1.1 cgd for (i = 0; i < next; i++)
236 1.1 cgd qp = qp->q_next;
237 1.1 cgd while (qp && qp->q_answered)
238 1.1 cgd qp = qp->q_next;
239 1.1 cgd if (!qp) {
240 1.1 cgd qsize = next;
241 1.1 cgd continue;
242 1.1 cgd }
243 1.1 cgd if (tflag && random() % 100 > 20) {
244 1.1 cgd /* repeat questions in tutorial mode */
245 1.1 cgd while (qp && (!qp->q_asked || qp->q_answered))
246 1.1 cgd qp = qp->q_next;
247 1.1 cgd if (!qp)
248 1.1 cgd continue;
249 1.1 cgd }
250 1.1 cgd s = qp->q_text;
251 1.1 cgd for (i = 0; i < catone - 1; i++)
252 1.1 cgd s = next_cat(s);
253 1.1 cgd if (!rxp_compile(s))
254 1.6 pk errx(1, "%s", rxperr);
255 1.1 cgd t = rxp_expand();
256 1.1 cgd if (!t || *t == '\0') {
257 1.1 cgd qp->q_answered = TRUE;
258 1.1 cgd continue;
259 1.1 cgd }
260 1.1 cgd (void)strcpy(question, t);
261 1.1 cgd s = qp->q_text;
262 1.1 cgd for (i = 0; i < cattwo - 1; i++)
263 1.1 cgd s = next_cat(s);
264 1.1 cgd if (!rxp_compile(s))
265 1.6 pk errx(1, "%s", rxperr);
266 1.1 cgd t = rxp_expand();
267 1.1 cgd if (!t || *t == '\0') {
268 1.1 cgd qp->q_answered = TRUE;
269 1.1 cgd continue;
270 1.1 cgd }
271 1.1 cgd qp->q_asked = TRUE;
272 1.1 cgd (void)printf("%s?\n", question);
273 1.1 cgd for (;; ++guesses) {
274 1.5 cgd if ((answer = fgetln(stdin, &len)) == NULL) {
275 1.1 cgd score(rights, wrongs, guesses);
276 1.1 cgd exit(0);
277 1.1 cgd }
278 1.4 cgd answer[len - 1] = '\0';
279 1.1 cgd downcase(answer);
280 1.1 cgd if (rxp_match(answer)) {
281 1.1 cgd (void)printf("Right!\n");
282 1.1 cgd ++rights;
283 1.1 cgd qp->q_answered = TRUE;
284 1.1 cgd break;
285 1.1 cgd }
286 1.1 cgd if (*answer == '\0') {
287 1.1 cgd (void)printf("%s\n", t);
288 1.1 cgd ++wrongs;
289 1.1 cgd if (!tflag)
290 1.1 cgd qp->q_answered = TRUE;
291 1.1 cgd break;
292 1.1 cgd }
293 1.1 cgd (void)printf("What?\n");
294 1.1 cgd }
295 1.1 cgd }
296 1.1 cgd score(rights, wrongs, guesses);
297 1.1 cgd }
298 1.1 cgd
299 1.1 cgd char *
300 1.1 cgd next_cat(s)
301 1.1 cgd register char * s;
302 1.1 cgd {
303 1.11 mycroft int esc;
304 1.11 mycroft
305 1.11 mycroft esc = 0;
306 1.1 cgd for (;;)
307 1.1 cgd switch (*s++) {
308 1.1 cgd case '\0':
309 1.1 cgd return (NULL);
310 1.1 cgd case '\\':
311 1.11 mycroft esc = 1;
312 1.1 cgd break;
313 1.1 cgd case ':':
314 1.11 mycroft if (!esc)
315 1.11 mycroft return (s);
316 1.11 mycroft default:
317 1.11 mycroft esc = 0;
318 1.11 mycroft break;
319 1.1 cgd }
320 1.1 cgd /* NOTREACHED */
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd char *
324 1.7 cgd appdstr(s, tp, len)
325 1.1 cgd char *s;
326 1.1 cgd register char *tp;
327 1.7 cgd size_t len;
328 1.1 cgd {
329 1.1 cgd register char *mp, *sp;
330 1.1 cgd register int ch;
331 1.1 cgd char *m;
332 1.1 cgd
333 1.7 cgd if ((m = malloc(strlen(s) + len + 1)) == NULL)
334 1.6 pk err(1, NULL);
335 1.1 cgd for (mp = m, sp = s; *mp++ = *sp++;);
336 1.8 cgd --mp;
337 1.1 cgd if (*(mp - 1) == '\\')
338 1.1 cgd --mp;
339 1.8 cgd
340 1.1 cgd while ((ch = *mp++ = *tp++) && ch != '\n');
341 1.1 cgd *mp = '\0';
342 1.1 cgd
343 1.1 cgd free(s);
344 1.1 cgd return (m);
345 1.1 cgd }
346 1.1 cgd
347 1.1 cgd void
348 1.1 cgd score(r, w, g)
349 1.1 cgd u_int r, w, g;
350 1.1 cgd {
351 1.1 cgd (void)printf("Rights %d, wrongs %d,", r, w);
352 1.1 cgd if (g)
353 1.1 cgd (void)printf(" extra guesses %d,", g);
354 1.1 cgd (void)printf(" score %d%%\n", (r + w + g) ? r * 100 / (r + w + g) : 0);
355 1.1 cgd }
356 1.1 cgd
357 1.1 cgd void
358 1.1 cgd downcase(p)
359 1.1 cgd register char *p;
360 1.1 cgd {
361 1.1 cgd register int ch;
362 1.1 cgd
363 1.1 cgd for (; ch = *p; ++p)
364 1.1 cgd if (isascii(ch) && isupper(ch))
365 1.1 cgd *p = tolower(ch);
366 1.1 cgd }
367 1.1 cgd
368 1.1 cgd void
369 1.1 cgd usage()
370 1.1 cgd {
371 1.1 cgd (void)fprintf(stderr, "quiz [-t] [-i file] category1 category2\n");
372 1.1 cgd exit(1);
373 1.1 cgd }
374