1 /* $OpenBSD: mkdict.c,v 1.13 2016/01/07 16:00:31 tb 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 /* 37 * Filter out words that: 38 * 1) Are not completely made up of lower case letters 39 * 2) Contain a 'q' not immediately followed by a 'u' 40 * 3) Are less than 3 characters long 41 * 4) Are greater than MAXWORDLEN characters long 42 */ 43 44 #include <ctype.h> 45 #include <err.h> 46 #include <limits.h> 47 #include <stdio.h> 48 #include <stdlib.h> 49 #include <string.h> 50 #include <unistd.h> 51 52 #include "bog.h" 53 54 int 55 main(int argc, char *argv[]) 56 { 57 char *p, *q; 58 const char *errstr; 59 int ch, common, nwords; 60 int n = 1; /* suppress maybe stuff */ 61 int current, len, prev, qcount; 62 char buf[2][MAXWORDLEN + 1]; 63 64 prev = 0; 65 current = 1; 66 buf[prev][0] = '\0'; 67 if (argc == 2) { 68 n = strtonum(argv[1], 1, INT_MAX, &errstr); 69 if (errstr) 70 errx(1, "%s: %s", argv[1], errstr); 71 } 72 73 for (nwords = 1; 74 fgets(buf[current], MAXWORDLEN + 1, stdin) != NULL; ++nwords) { 75 if ((p = strchr(buf[current], '\n')) == NULL) { 76 warnx("word too long: %s", buf[current]); 77 while ((ch = getc(stdin)) != EOF && ch != '\n') 78 ; 79 if (ch == EOF) 80 break; 81 continue; 82 } 83 len = 0; 84 for (p = buf[current]; *p != '\n'; p++) { 85 if (!islower((unsigned char)*p)) 86 break; 87 if (*p == 'q') { 88 q = p + 1; 89 if (*q != 'u') 90 break; 91 else { 92 while ((*q = *(q + 1))) 93 q++; 94 } 95 len++; 96 } 97 len++; 98 } 99 if (*p != '\n' || len < 3 || len > MAXWORDLEN) 100 continue; 101 if (argc == 2 && nwords % n) 102 continue; 103 104 *p = '\0'; 105 p = buf[current]; 106 q = buf[prev]; 107 qcount = 0; 108 while ((ch = *p++) == *q++ && ch != '\0') 109 if (ch == 'q') 110 qcount++; 111 common = p - buf[current] - 1; 112 printf("%c%s", common + qcount, p - 1); 113 prev = !prev; 114 current = !current; 115 } 116 warnx("%d words", nwords); 117 return 0; 118 } 119