1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include <string>
#include "glk/alan2/alan2.h"
#include "glk/alan2/debug.h"
#include "glk/alan2/exe.h"
#include "glk/alan2/glkio.h"
#include "glk/alan2/inter.h"
#include "glk/alan2/main.h"
#include "glk/alan2/params.h"
#include "glk/alan2/parse.h"
#include "glk/alan2/readline.h"
#include "glk/alan2/term.h"
#include "glk/alan2/types.h"
namespace Glk {
namespace Alan2 {
#define LISTLEN 100
/* PUBLIC DATA */
int wrds[LISTLEN/2] = {EOF}; /* List of parsed words */
int wrdidx; /* and an index into it */
Boolean plural = FALSE;
/* Syntax Parameters */
int paramidx; /* Index in params */
ParamElem *params; /* List of params */
static ParamElem *pparams; /* Previous parameter list */
static ParamElem *mlst; /* Multiple objects list */
static ParamElem *pmlst; /* Previous multiple list */
/* Literals */
LitElem litValues[MAXPARAMS+1];
int litCount;
/* What did the user say? */
int vrbwrd; /* The word he used */
int vrbcode; /* The code for that verb */
/*----------------------------------------------------------------------*\
SCAN DATA & PROCEDURES
All procedures for getting a command and turning it into a list of
dictionary entries are placed here.
buf
unknown()
lookup()
token
agetline()
scan()
\*----------------------------------------------------------------------*/
/* PRIVATE DATA */
static char buf[LISTLEN+1]; /* The input buffer */
static char isobuf[LISTLEN+1]; /* The input buffer in ISO */
static Boolean eol = TRUE; /* Looking at End of line? Yes, initially */
static void unknown(char token[]) {
char *str = (char *)allocate((int)strlen(token)+4);
str[0] = '\'';
strcpy(&str[1], token);
strcat(str, "'?");
output(str);
free(str);
eol = TRUE;
error(M_UNKNOWN_WORD);
}
static char *token;
static int lookup(char wrd[]) {
int i;
for (i = 0; !endOfTable(&dict[i]); i++) {
if (strcmp(wrd, (char *) addrTo(dict[i].wrd)) == 0)
return (i);
}
unknown(wrd);
return(EOF);
}
static int number(char token[] /* IN - The string to convert to a number */) {
int i;
sscanf(token, "%d", &i);
return i;
}
static char *gettoken(char *buf) {
static char *marker;
static char oldch;
if (buf == NULL)
*marker = oldch;
else
marker = buf;
while (*marker != '\0' && isSpace(*marker) && *marker != '\n') marker++;
buf = marker;
if (isISOLetter(*marker))
while (*marker&&(isISOLetter(*marker)||isdigit(*marker)||*marker=='\'')) marker++;
else if (isdigit(*marker))
while (isdigit(*marker)) marker++;
else if (*marker == '\"') {
marker++;
while (*marker != '\"') marker++;
marker++;
} else if (*marker == '\0' || *marker == '\n')
return NULL;
else
marker++;
oldch = *marker;
*marker = '\0';
return buf;
}
static void agetline() {
para();
do {
statusline();
printf("> ");
if (logflg)
fprintf(logfil, "> ");
if (!readline(buf)) {
if (g_vm->shouldQuit())
return;
newline();
quit();
}
getPageSize();
anyOutput = FALSE;
if (logflg)
fprintf(logfil, "%s\n", buf);
strcpy(isobuf, buf);
token = gettoken(isobuf);
if (token != NULL && strcmp("debug", token) == 0 && header->debug) {
dbgflg = TRUE;
debug();
token = NULL;
}
} while (token == NULL);
eol = FALSE;
lin = 1;
}
static void scan() {
int i;
int w;
char *str;
agetline();
if (g_vm->shouldQuit())
return;
wrds[0] = 0;
for (i = 0; i < litCount; i++)
if (litValues[i].type == TYPSTR && litValues[i].value != 0)
free((char *) litValues[i].value);
i = 0;
litCount = 0;
do {
if (isISOLetter(token[0])) {
(void) stringLower(token);
w = lookup(token);
if (!isNoise(w))
wrds[i++] = w;
} else if (isdigit(token[0])) {
if (litCount > MAXPARAMS)
syserr("Too many parameters.");
wrds[i++] = dictsize+litCount; /* Word outside dictionary = literal */
litValues[litCount].type = TYPNUM;
litValues[litCount++].value = number(token);
} else if (token[0] == '\"') {
if (litCount > MAXPARAMS)
syserr("Too many parameters.");
wrds[i++] = dictsize+litCount; /* Word outside dictionary = literal */
litValues[litCount].type = TYPSTR;
/* Remove the string quotes while copying */
str = strdup(&token[1]);
str[strlen(token)-2] = '\0';
litValues[litCount++].value = (Aptr) str;
} else if (token[0] == ',') {
wrds[i++] = conjWord;
} else
unknown(token);
wrds[i] = EOF;
eol = (token = gettoken(NULL)) == NULL;
} while (!eol);
}
/*----------------------------------------------------------------------*\
PARSE DATA & PROCEDURES
All procedures and data for getting a command and parsing it
nonverb() - search for a non-verb command
buildall() - build a list of objects matching 'all'
unambig() - match an unambigous object reference
simple() - match a simple verb command
complex() - match a complex -"-
tryMatch()- to match a verb command
match() - find the verb class (not used currently) and 'tryMatch()'
\*---------------------------------------------------------------------- */
static int allLength; /* No. of objects matching 'all' */
static void nonverb() {
if (isDir(wrds[wrdidx])) {
wrdidx++;
if (wrds[wrdidx] != EOF && !isConj(wrds[wrdidx]))
error(M_WHAT);
else
go(dict[wrds[wrdidx-1]].code);
if (wrds[wrdidx] != EOF)
wrdidx++;
} else
error(M_WHAT);
}
static void buildall(ParamElem list[]) {
int o, i = 0;
Boolean found = FALSE;
for (o = OBJMIN; o <= OBJMAX; o++)
if (isHere(o)) {
found = TRUE;
list[i].code = o;
list[i++].firstWord = EOF;
}
if (!found)
error(M_WHAT_ALL);
else
list[i].code = EOF;
}
static void unambig(ParamElem plst[]) {
int i;
Boolean found = FALSE; /* Adjective or noun found ? */
static ParamElem *refs; /* Entities referenced by word */
static ParamElem *savlst; /* Saved list for backup at EOF */
int firstWord, lastWord; /* The words the player used */
if (refs == NULL)
refs = (ParamElem *)allocate((MAXENTITY+1)*sizeof(ParamElem));
if (savlst == NULL)
savlst = (ParamElem *)allocate((MAXENTITY+1)*sizeof(ParamElem));
if (isLiteral(wrds[wrdidx])) {
/* Transform the word into a reference to the literal value */
plst[0].code = wrds[wrdidx++]-dictsize+LITMIN;
plst[0].firstWord = EOF; /* No words used! */
plst[1].code = EOF;
return;
}
plst[0].code = EOF; /* Make empty */
if (isIt(wrds[wrdidx])) {
wrdidx++;
/* Use last object in previous command! */
for (i = lstlen(pparams)-1; i >= 0 && (pparams[i].code == 0 || pparams[i].code >= LITMIN); i--);
if (i < 0)
error(M_WHAT_IT);
if (!isHere(pparams[i].code)) {
params[0].code = pparams[i].code;
params[0].firstWord = EOF;
params[1].code = EOF;
error(M_NO_SUCH);
}
plst[0] = pparams[i];
plst[0].firstWord = EOF; /* No words used! */
plst[1].code = EOF;
return;
}
firstWord = wrdidx;
while (wrds[wrdidx] != EOF && isAdj(wrds[wrdidx])) {
/* If this word can be a noun and there is no noun following break loop */
if (isNoun(wrds[wrdidx]) && (wrds[wrdidx+1] == EOF || !isNoun(wrds[wrdidx+1])))
break;
cpyrefs(refs, (Aword *)addrTo(dict[wrds[wrdidx]].adjrefs));
lstcpy(savlst, plst); /* To save it for backtracking */
if (found)
isect(plst, refs);
else {
lstcpy(plst, refs);
found = TRUE;
}
wrdidx++;
}
if (wrds[wrdidx] != EOF) {
if (isNoun(wrds[wrdidx])) {
cpyrefs(refs, (Aword *)addrTo(dict[wrds[wrdidx]].nounrefs));
if (found)
isect(plst, refs);
else {
lstcpy(plst, refs);
found = TRUE;
}
wrdidx++;
} else
error(M_NOUN);
} else if (found) {
if (isNoun(wrds[wrdidx-1])) {
/* Perhaps the last word was also a noun? */
lstcpy(plst, savlst); /* Restore to before last adjective */
cpyrefs(refs, (Aword *)addrTo(dict[wrds[wrdidx-1]].nounrefs));
if (plst[0].code == EOF)
lstcpy(plst, refs);
else
isect(plst, refs);
} else
error(M_NOUN);
}
lastWord = wrdidx-1;
/* Allow remote objects, but resolve ambiguities by presence */
if (lstlen(plst) > 1) {
for (i=0; plst[i].code != EOF; i++)
if (!isHere(plst[i].code))
plst[i].code = 0;
compact(plst);
}
if (lstlen(plst) > 1 || (found && lstlen(plst) == 0)) {
params[0].code = 0; /* Just make it anything != EOF */
params[0].firstWord = firstWord; /* Remember words for errors below */
params[0].lastWord = lastWord;
params[1].code = EOF; /* But be sure to terminate */
if (lstlen(plst) > 1)
error(M_WHICH_ONE);
else if (found && lstlen(plst) == 0)
error(M_NO_SUCH);
} else {
plst[0].firstWord = firstWord;
plst[0].lastWord = lastWord;
}
}
static void simple(ParamElem olst[]) {
static ParamElem *tlst = NULL;
int savidx = wrdidx;
Boolean savplur = FALSE;
int i;
if (tlst == NULL)
tlst = (ParamElem *) allocate(sizeof(ParamElem)*(MAXENTITY+1));
tlst[0].code = EOF;
for (;;) {
if (isThem(wrds[wrdidx])) {
plural = TRUE;
for (i = 0; pmlst[i].code != EOF; i++)
if (!isHere(pmlst[i].code))
pmlst[i].code = 0;
compact(pmlst);
if (lstlen(pmlst) == 0)
error(M_WHAT_THEM);
lstcpy(olst, pmlst);
olst[0].firstWord = EOF; /* No words used */
wrdidx++;
} else {
unambig(olst); /* Look for unambigous noun phrase */
if (lstlen(olst) == 0) { /* Failed! */
lstcpy(olst, tlst);
wrdidx = savidx;
plural = savplur;
return;
}
}
mrglst(tlst, olst);
if (wrds[wrdidx] != EOF
&& (isConj(wrds[wrdidx]) &&
(isAdj(wrds[wrdidx+1]) || isNoun(wrds[wrdidx+1])))) {
/* More parameters in a conjunction separated list ? */
savplur = plural;
savidx = wrdidx;
wrdidx++;
plural = TRUE;
} else {
lstcpy(olst, tlst);
return;
}
}
}
/*----------------------------------------------------------------------
complex()
Above this procedure we can use the is* tests, but not below since
they work on words. Below all is converted to indices into the
entity tables. Particularly this goes for literals...
*/
static void complex(ParamElem olst[]) {
static ParamElem *alst = NULL;
if (alst == NULL)
alst = (ParamElem *) allocate((MAXENTITY+1)*sizeof(ParamElem));
if (isAll(wrds[wrdidx])) {
plural = TRUE;
buildall(alst); /* Build list of all objects */
wrdidx++;
if (wrds[wrdidx] != EOF && isBut(wrds[wrdidx])) {
wrdidx++;
simple(olst);
if (lstlen(olst) == 0)
error(M_AFTER_BUT);
sublst(alst, olst);
if (lstlen(alst) == 0)
error(M_NOT_MUCH);
}
lstcpy(olst, alst);
allLength = lstlen(olst);
} else
simple(olst); /* Look for simple noun group */
}
static Boolean claCheck(ClaElem *cla /* IN - The cla elem to check */) {
Boolean ok = FALSE;
if ((cla->classes&(Aword)CLA_OBJ) != 0)
ok = ok || isObj(params[cla->code-1].code);
if ((cla->classes&(Aword)CLA_CNT) != 0)
ok = ok || isCnt(params[cla->code-1].code);
if ((cla->classes&(Aword)CLA_ACT) != 0)
ok = ok || isAct(params[cla->code-1].code);
if ((cla->classes&(Aword)CLA_NUM) != 0)
ok = ok || isNum(params[cla->code-1].code);
if ((cla->classes&(Aword)CLA_STR) != 0)
ok = ok || isStr(params[cla->code-1].code);
if ((cla->classes&(Aword)CLA_COBJ) != 0)
ok = ok || (isCnt(params[cla->code-1].code) && isObj(params[cla->code-1].code));
if ((cla->classes&(Aword)CLA_CACT) != 0)
ok = ok || (isCnt(params[cla->code-1].code) && isAct(params[cla->code-1].code));
return ok;
}
/*----------------------------------------------------------------------
resolve()
In case the syntax did not indicate omnipotent powers (allowed
access to remote object), we need to remove non-present parameters
*/
static void resolve(ParamElem plst[]) {
int i;
if (allLength > 0) return; /* ALL has already done this */
/* Resolve ambiguities by presence */
for (i=0; plst[i].code != EOF; i++)
if (plst[i].code < LITMIN) /* Literals are always 'here' */
if (!isHere(plst[i].code)) {
params[0] = plst[i]; /* Copy error param as first one for message */
params[1].code = EOF; /* But be sure to terminate */
error(M_NO_SUCH);
}
}
static void tryMatch(ParamElem mlst[] /* OUT - List of params allowed by multiple */) {
ElmElem *elms; /* Pointer to element list */
StxElem *stx; /* Pointer to syntax list */
ClaElem *cla; /* Pointer to class definitions */
Boolean anyPlural = FALSE; /* Any parameter that was plural? */
int i, p;
static ParamElem *tlst = NULL; /* List of params found by complex() */
static Boolean *checked = NULL; /* Corresponding parameter checked? */
if (tlst == NULL) {
tlst = (ParamElem *) allocate((MAXENTITY+1)*sizeof(ParamElem));
checked = (Boolean *) allocate((MAXENTITY+1)*sizeof(Boolean));
}
for (stx = stxs; !endOfTable(stx); stx++)
if (stx->code == vrbcode)
break;
if (endOfTable(stx))
error(M_WHAT);
elms = (ElmElem *) addrTo(stx->elms);
while (TRUE) {
/* End of input? */
if (wrds[wrdidx] == EOF || isConj(wrds[wrdidx])) {
while (!endOfTable(elms) && elms->code != EOS)
elms++;
if (endOfTable(elms))
error(M_WHAT);
else
break;
} else {
/* A preposition? */
if (isPrep(wrds[wrdidx])) {
while (!endOfTable(elms) && elms->code != dict[wrds[wrdidx]].code)
elms++;
if (endOfTable(elms))
error(M_WHAT);
else
wrdidx++;
} else {
/* Must be a parameter! */
while (!endOfTable(elms) && elms->code != 0)
elms++;
if (endOfTable(elms))
error(M_WHAT);
/* Get it! */
plural = FALSE;
complex(tlst);
if (lstlen(tlst) == 0) /* No object!? */
error(M_WHAT);
if ((elms->flags & OMNIBIT) == 0) /* Omnipotent parameter? */
/* If its not an omnipotent parameter, resolve by presence */
resolve(tlst);
if (plural) {
if ((elms->flags & MULTIPLEBIT) == 0) /* Allowed multiple? */
error(M_MULTIPLE);
else {
/*
Mark this as the multiple position in which to insert
actual parameter values later
*/
params[paramidx++].code = 0;
lstcpy(mlst, tlst);
anyPlural = TRUE;
}
} else
params[paramidx++] = tlst[0];
params[paramidx].code = EOF;
}
elms = (ElmElem *) addrTo(elms->next);
}
}
/* Now perform class checks */
if (elms->next == 0) /* No verb code, verb not declared! */
error(M_CANT0);
for (p = 0; params[p].code != EOF; p++) /* Mark all parameters unchecked */
checked[p] = FALSE;
for (cla = (ClaElem *) addrTo(elms->next); !endOfTable(cla); cla++) {
if (params[cla->code-1].code == 0) {
/* This was a multiple parameter, so check all and remove failing */
for (i = 0; mlst[i].code != EOF; i++) {
params[cla->code-1] = mlst[i];
if (!claCheck(cla)) {
/* Multiple could be both an explicit list of params and an ALL */
if (allLength == 0) {
char marker[80];
/*
It wasn't ALL, we need to say something about it, so
prepare a printout with $1/2/3
*/
sprintf(marker, "($%ld)", (unsigned long) cla->code);
output(marker);
interpret(cla->stms);
para();
}
mlst[i].code = 0; /* In any case remove it from the list */
}
}
params[cla->code-1].code = 0;
} else {
if (!claCheck(cla)) {
interpret(cla->stms);
error(MSGMAX); /* Return to player without saying anything */
}
}
checked[cla->code-1] = TRUE; /* Remember that it's already checked */
}
/* Now check the rest of the parameters, must be objects */
for (p = 0; params[p].code != EOF; p++)
if (!checked[p]) {
if (params[p].code == 0) {
/* This was a multiple parameter, check all and remove failing */
for (i = 0; mlst[i].code != EOF; i++)
if (mlst[i].code != 0) /* Skip any empty slots */
if (!isObj(mlst[i].code))
mlst[i].code = 0;
} else if (!isObj(params[p].code))
error(M_CANT0);
}
/* Set verb code */
cur.vrb = ((Aword *) cla)[1]; /* Take first word after end of table! */
/* Finally, if ALL was used, try to find out what was applicable */
if (allLength > 0) {
for (p = 0; params[p].code != 0; p++); /* Find multiple marker */
for (i = 0; i < allLength; i++) {
if (mlst[i].code != 0) { /* Already empty? */
params[p] = mlst[i];
if (!possible())
mlst[i].code = 0; /* Remove this from list */
}
}
params[p].code = 0; /* Restore multiple marker */
compact(mlst);
if (lstlen(mlst) == 0) {
params[0].code = EOF;
error(M_WHAT_ALL);
}
} else if (anyPlural) {
compact(mlst);
if (lstlen(mlst) == 0)
/* If there where multiple parameters but non left, exit without a */
/* word, assuming we have already said enough */
error(MSGMAX);
}
plural = anyPlural; /* Remember that we found plural objects */
}
static void match(ParamElem *mlst /* OUT - List of params allowed by multiple */) {
tryMatch(mlst); /* ... to understand what he said */
if (wrds[wrdidx] != EOF && !isConj(wrds[wrdidx]))
error(M_WHAT);
if (wrds[wrdidx] != EOF) /* More on this line? */
wrdidx++; /* If so skip the AND */
}
void parse() {
if (mlst == NULL) { /* Allocate large enough paramlists */
mlst = (ParamElem *) allocate(sizeof(ParamElem)*(MAXENTITY+1));
mlst[0].code = EOF;
pmlst = (ParamElem *) allocate(sizeof(ParamElem)*(MAXENTITY+1));
params = (ParamElem *) allocate(sizeof(ParamElem)*(MAXENTITY+1));
params[0].code = EOF;
pparams = (ParamElem *) allocate(sizeof(ParamElem)*(MAXENTITY+1));
}
if (wrds[wrdidx] == EOF) {
wrdidx = 0;
scan();
if (g_vm->shouldQuit())
return;
} else if (anyOutput)
para();
allLength = 0;
paramidx = 0;
lstcpy(pparams, params);
params[0].code = EOF;
lstcpy(pmlst, mlst);
mlst[0].code = EOF;
if (isVerb(wrds[wrdidx])) {
vrbwrd = wrds[wrdidx];
vrbcode = dict[vrbwrd].code;
wrdidx++;
match(mlst);
action(mlst); /* mlst contains possible multiple params */
} else {
params[0].code = EOF;
pmlst[0].code = EOF;
nonverb();
}
}
} // End of namespace Alan2
} // End of namespace Glk
|