english.c

操作系统源代码

/*	program ENGLISH.C					*/


#include	<stdio.h>
#include	<string.h>
#include	<ctype.h>
#include	<stdlib.h>
#include	"advent.h"
#include	"advdec.h"

#define ALL	109

#define ENTER	 3
#define CRAWL	17
#define JUMP	39
#define CLIMB	56
#define XYZZY	62
#define PLUGH	65
#define PLOVER	71
#define PHUCE	82

_PROTOTYPE(static void getwords, (void));
_PROTOTYPE(static void clrlin, (void));
_PROTOTYPE(static void doobj, (int *));
_PROTOTYPE(static boolean doiobj, (void));
_PROTOTYPE(static boolean do_scoop_up, (void));
_PROTOTYPE(static boolean check_next, (void));

static char buffer[INPUTBUFLEN] = {'\0', '\0', '\0', '\0'};
static char *txt[MAXWORDS] = {buffer, buffer, buffer, buffer};
static char *cindex = buffer;
static boolean pflag;
static int vrbkey, words[MAXWORDS] = {0, 0, 0, 0}, word, wdx = 0;
static int takdir[20] = {2,  6,  9, 10, 11, 13, 14, 17, 23, 25,
			33, 34, 36, 37, 39, 78, 79, 80, 89, -1};

static int vkey[60] = {
     0,   199,     9,     0,   130,     0,   197,     0,     0,   243,
     0,     0,    89,   140,     0,     5,     0,   227,     0,     0,
     0,    31,    42,     0,     0,     0,     0,   172,     1,     0,
     0,     0,   254,     0,    69,     0,     0,    92,     0,     0,
   138,   137,   149,   239,    45,    74,   183,     0,     0,   112,
   241,     0,   114,     0,    30,     0,     0,     0,     0,     0
};

static int ptab[260] = {
     0,  3028,  3065,  3009, -3005,  5071,  5070,  5058, -5020, 19055,
 19108, 19038, 19020, 19071, 19070, 19058, 19004, 19048, 19091, 19094,
 19112, 19002, 19118,  2062,  2066,  2047,  2067,  2053,  2065, -2010,
 -3114,  4034,  4011,  4101,  4035,  4099,  4098,  4017,  4104,  4014,
  4015, -4087,  3083,  3085, -3081,  5055,  5108,  5020,  5071,  5070,
  5058,  5004,  5048,  5091,  5112,  5099,  5118, 19055, 19108, 19020,
 19071, 19070, 19058, 19004, 19048, 19091, 19112, 19099,-19118,  3028,
  3065,  3009,  3005, -3018, 19055, 19108, 19038, 19020, 19071, 19070,
 19058, 19004, 19004, 19048, 19091, 19094, 19112, 19002,-19118,  3028,
  3065, -3018, 19055, 19108, 19038, 19020, 19071, 19070, 19058, 19004,
 19048, 19091, 19094, 19112, 19118,  2062,  2066,  2047,  2067,  2053,
  2065, -2010,  3102, -3090, 19055, 19108, 19020, 19071, 19070, 19058,
 19004, 19048, 19091, 19014, 19015, 19112, 19118, 19120, 19120, -9999,
  3090,  3102,  3028,  3057,  3065,  3009, -3005,-29999,  2052, -2068,
  2024,  2065,  2091,  2042,  2073,  5071,  5070,  5058, -5020, 30999,
  2062,  2066,  2047,  2067,  2053,  2065,  2010,  2073, 19055, 19108,
 19038, 19020, 19071, 19070, 19058, 19004, 19048, 19091, 19094, 19112,
 19002,-19118,  2014,  2015,  2013,  2999,  5014,  5015,  5013,  5999,
  5110,  5113, -5999,  5055,  5108,  5020,  5071,  5070,  5058,  5004,
  5048,  5091,  5014,  5015,  5112,  5099, -5118,  3102, -3090,  6066,
  6047,  6067,  6053,  6072,  6073,  5055,  5108,  5020,  5071,  5070,
  5004,  5004,  5048,  5091,  5112,  5099,  5118, 19055, 19108, 19020,
 19071, 19070, 19058, 19004, 19048, 19091,-19118,  4034,  4011,  4101,
  4035,  4099,  4098,  4017,  4104,  4027,  4087,  9999,-30999,  2002,
 -6002,  3102, -3090,  9999,  4034,  4011,  4101,  4035,  4099,  4087,
  4098,  4017,  4104, -4027, -5999,     0,     0,     0,     0,     0,
};

static int adjkey[40] = {
     0,    15,    38,    64,     4,    63,     1,    61,    62,    67,
     9,    27,    53,    46,    47,    60,    31,    39,    40,     6,
    43,    26,    32,    28,    34,    50,    49,    45,    44,    10,
    20,    25,    21,    36,    37,    30,    33,     0,     0,     0
};

static int adjtab[70] = {
     0,     5,    98,   -83,     2,   -90,    66,    41,   -90,   -39,
    41,    14,    15,    50,   -11,    50,    64,    56,    72,   -74,
   -19,   119,    59,    73,  -118,  -119,   -70,   -41,    95,  -118,
  -118,   -58,   -71,  -120,   110,  -108,  -120,   -73,   -62,   -60,
   110,    54,   -63,   -67,   -41,   -27,   -47,    52,   -75,   -69,
    65,   112,    -3,    41,    72,    90,    20,   101,   107,  -118,
   -55,   -10,   -38,    -4,    48,     9,   -71,   -39,     0,     0
};

/*
  Analyze a two word sentence
*/
int english()
{

    char *ch_ptr, *word1, *word2;
    int type, val, type2, val2, adj, k, kk;
    static int iwest = 0;

    if (!(words[++wdx])) {
	getwords();
	wdx = 0;
    }
    pflag = FALSE;
    word = words[wdx];
    if (word < 0) {			/* check first word	 */
	printf("I didn't understand the word \"%s\"\n", txt[wdx]);
	words[wdx+1] = 0;
	return (FALSE);			/* didn't know it	 */
    }
    type2 = val2 = -1;
    type = CLASS(word);
    clrlin();
    val = VAL(word);
    if (words[wdx + 1] && CLASS(words[wdx + 1]) != CONJUNCTION) {

	/* 'SAY' or 'CALL'.  If no next word, pass on to higher powers. */
	if (type == ACTION && (val == SAY || val == YELL)) {
	    word = words[++wdx];
	    if (!(word == XYZZY || word == PLUGH
		  || word == PLOVER || word == PHUCE)) {
		if (val == SAY)
		    printf("Okay, \"%s\".\n", txt[wdx]);
		else {
		    for (ch_ptr = txt[wdx]; *ch_ptr; ch_ptr++)
			if (islower(*ch_ptr))
			    *ch_ptr = toupper(*ch_ptr);
		    printf("Okay, \"%s\"!!!!!\n", txt[wdx]);
		}
		return (FALSE);
	    }
	} else {
	    word1 = txt[wdx];
	    word2 = txt[wdx + 1];

	    /* Special stuff for 'ENTER'.  Can't go into water. 'ENTER
	       BOAT' means 'TAKE BOAT' */
	    if (word == ENTER) {
		if (CLASS(words[wdx + 1]) == NOUN && VAL(words[wdx + 1]) == BOAT)
		    word = TAKE + 2000;
		else if ((strcmp(word2, "stream") == 0)
			 || (strcmp(word2, "water") == 0)
			 || (strcmp(word2, "reservoir") == 0)
			 || (strcmp(word2, "ocean") == 0)
			 || (strcmp(word2, "sea") == 0)
			 || (strcmp(word2, "pool") == 0)) {
		    rspeak(liqloc(g.loc) == WATER ? 70 : 43);
		    wdx++;
		    return (FALSE);
		}
	    } else {
		type2 = CLASS(words[wdx + 1]);
		val2 = VAL(words[wdx + 1]);

		/* 'LEAVE' is motion verb, unsless leaving an object.
		   E.G., 'LEAVE BOAT' or 'LEAVE BOTTLE'.  BUt make sure
		   to leave ('DROP') only totable objects. */
		if (strcmp(word1, "leave") == 0 && type2 == NOUN) {
		    if (!hinged(val2) || g.fixed[val2])
			word = LEAVE + 2000;

		    /* IF 'LIGHT LAMP', Light must be taken as an
		       action verb, not a noun. */
		} else if (strcmp(word1, "light") == 0
			   && VAL(words[wdx + 1]) == LAMP) {
		    word = ON + 2000;

		    /* 'WATER PLANT' becomes 'POUR WATER', If we are at
		       plant. 'OIL DOOR' becomes 'POUR OIL', etc., etc. */
		} else if ((strcmp(word1, "water") == 0 || strcmp(word1, "oil") == 0)
			   && (strcmp(word2, "plant") == 0 || strcmp(word2, "door") == 0
			       || strcmp(word2, "sword") == 0 || strcmp(word2, "anvil") == 0)
			   && at(val2)) {
		    words[wdx + 1] = word;
		    txt[wdx + 1] = txt[wdx];
		    word = POUR + 2000;
		}
	    }
	}

    }
    /* This is the 'inner' loop.  Dispatching of all word in a clause
       after the first comes through here. */
    do {
	switch (CLASS(word)) {
	case MOTION:
	    {
		boolean do_part2;
		int i;

		do_part2 = FALSE;
		type = CLASS(verbs[vrbx]);
		val = VAL(verbs[vrbx]);
		if (!vrbx)
		    do_part2 = TRUE;
		else {
		    if (type > ACTION) {
			rspeak(confuz());
			return (FALSE);
		    }
		}
		if (type == ACTION) {
		    if (val == GO)
			do_part2 = TRUE;
		    else {
			if (val == TAKE) {
			    for (i = 0; i < 20; i++)
				if (takdir[i] == val)
				    do_part2 = TRUE;
			}
			if (!do_part2) {
			    word = vocab(txt[wdx], 1);
			    if (word)
				words[wdx--] = word;
			}
		    }
		} else if (type != CRAWL && type != JUMP
			   && type != CLIMB)
		    do_part2 = TRUE;
		if (do_part2) {
		    verbs[1] = word;
		    vrbx = 1;
		    if (strcmp(txt[wdx], "west") == 0) {
			iwest++;
			if (iwest == 10)
			    rspeak(17);
		    }
		}
		break;
	    }
	case NOUN:
	    if (pflag) {
		if (!doiobj())
		    return (FALSE);
	    } else {
		word = VAL(word);
		if (word == ALL) {
		    if (!do_scoop_up())
			return (FALSE);
		} else {
		    doobj(&word);
		    if (word > 0) {
			objs[++objx] = word;
			otxt[objx] = txt[wdx];
		    } else {
			clrlin();
			pflag = FALSE;
			wdx++;
			while (words[wdx]) {
			    if (CLASS(words[wdx]) == CONJUNCTION)
				break;
			    wdx++;
			}
			if (words[wdx] == 0)
			    return (FALSE);
		    }
		}
	    }
	    break;
	case ACTION:
	    if (vrbx == 0)
		vrbx++;
	    else {
		if (VAL(verbs[vrbx]) == TAKE) {
		    val = VAL(word);
		    if (val == DRINK || val == INVENTORY
			|| val == SCORE || val == NOTHING
			|| val == LOOK);
		    else if (val == GO && (
					 strcmp(txt[wdx], "walk") == 0
				       || strcmp(txt[wdx], "run") == 0
				   || strcmp(txt[wdx], "hike") == 0));
		    else {
			rspeak(confuz());
			return (FALSE);
		    }
		} else if (objx || CLASS(words[wdx - 1]) == CONJUNCTION) {
		    rspeak(confuz());
		    return (FALSE);
		}
	    }
	    verbs[vrbx] = word;
	    vtxt[vrbx] = txt[wdx];
	    break;
	case MISC:
	    if (vrbx) {
		rspeak(confuz());
		return (FALSE);
	    }
	    verbs[1] = word;
	    vrbx = 1;
	    break;
	case PREPOSITION:
	    if (CLASS(verbs[vrbx]) != ACTION || iobx) {
		rspeak(confuz());
		return (FALSE);
	    }
	    vrbkey = vkey[VAL(verbs[vrbx])];
	    if (!vrbkey) {
		rspeak(confuz());
		return (FALSE);
	    }
	    prep = VAL(word);
	    pflag = TRUE;
	    break;
	case ADJACTIVE:
	    /* Adjective handler. Scarf the next word, make sure it is
	       a valid object for this object.  Then call getobj to see
	       if it is really there, Then link into object code. */
	    adj = VAL(word);
	    if (!check_next())
		return (FALSE);
	    else if (CLASS(word) == CONJUNCTION) {
		printf("%s what?\n", txt[wdx - 1]);
		return (FALSE);
	    } else {
		if (CLASS(word) != NOUN)
		    word = vocab(txt[wdx], NOUN);
		if (word == -1 || CLASS(word) != NOUN || VAL(word) == ALL) {
		    rspeak(confuz());
		    return (FALSE);
		}
		words[wdx] = word;
		kk = VAL(word);
		for (k = adjkey[adj]; adjtab[k] >= 0; k++) {
		    if (kk == abs(adjtab[k]))
			break;
		}
		if (adjtab[k] < 0) {
		    rspeak(confuz());
		    return (FALSE);
		}
	    }
	    break;
	case CONJUNCTION:
	    if (!check_next())
		return (FALSE);