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
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
|
/* 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.
*
*/
// Main vocabulary support functions and word lookup
#include "sci/parser/vocabulary.h"
#include "sci/resource.h"
#include "sci/engine/state.h"
#include "sci/engine/kernel.h"
#include "sci/console.h"
namespace Sci {
Vocabulary::Vocabulary(ResourceManager *resMan, bool foreign) : _resMan(resMan), _foreign(foreign) {
_parserRules = NULL;
memset(_parserNodes, 0, sizeof(_parserNodes));
// Mark parse tree as unused
_parserNodes[0].type = kParseTreeLeafNode;
_parserNodes[0].value = 0;
_parserNodes[0].right = 0;
_synonyms.clear(); // No synonyms
debug(2, "Initializing vocabulary");
if (_resMan->testResource(ResourceId(kResourceTypeVocab, VOCAB_RESOURCE_SCI0_MAIN_VOCAB))) {
_vocabVersion = kVocabularySCI0;
_resourceIdWords = VOCAB_RESOURCE_SCI0_MAIN_VOCAB;
_resourceIdSuffixes = VOCAB_RESOURCE_SCI0_SUFFIX_VOCAB;
_resourceIdBranches = VOCAB_RESOURCE_SCI0_PARSE_TREE_BRANCHES;
} else {
_vocabVersion = kVocabularySCI1;
_resourceIdWords = VOCAB_RESOURCE_SCI1_MAIN_VOCAB;
_resourceIdSuffixes = VOCAB_RESOURCE_SCI1_SUFFIX_VOCAB;
_resourceIdBranches = VOCAB_RESOURCE_SCI1_PARSE_TREE_BRANCHES;
}
if (_foreign) {
_resourceIdWords += 10;
_resourceIdSuffixes += 10;
_resourceIdBranches += 10;
}
if (getSciVersion() <= SCI_VERSION_1_EGA_ONLY && loadParserWords()) {
loadSuffixes();
if (loadBranches())
// Now build a GNF grammar out of this
_parserRules = buildGNF();
} else {
debug(2, "Assuming that this game does not use a parser.");
_parserRules = NULL;
}
loadAltInputs();
parser_event = NULL_REG;
parserIsValid = false;
_pronounReference = 0x1000; // Non-existent word
}
Vocabulary::~Vocabulary() {
freeRuleList(_parserRules);
freeSuffixes();
freeAltInputs();
}
void Vocabulary::reset() {
parserIsValid = false; // Invalidate parser
parser_event = NULL_REG; // Invalidate parser event
}
bool Vocabulary::loadParserWords() {
char currentWord[VOCAB_MAX_WORDLENGTH] = "";
int currentWordPos = 0;
// First try to load the SCI0 vocab resource.
Resource *resource = _resMan->findResource(ResourceId(kResourceTypeVocab, _resourceIdWords), 0);
if (!resource) {
warning("Could not find a main vocabulary");
return false; // NOT critical: SCI1 games and some demos don't have one!
}
VocabularyVersions resourceType = _vocabVersion;
if (resourceType == kVocabularySCI0) {
if (resource->size < 26 * 2) {
warning("Invalid main vocabulary encountered: Much too small");
return false;
}
// Check the alphabet-offset table for any content
int alphabetNr;
for (alphabetNr = 0; alphabetNr < 26; alphabetNr++) {
if (READ_LE_UINT16(resource->data + alphabetNr * 2))
break;
}
// If all of them were empty, we are definitely seeing SCI01 vocab in disguise (e.g. pq2 japanese)
if (alphabetNr == 26) {
warning("SCI0: Found SCI01 vocabulary in disguise");
resourceType = kVocabularySCI1;
}
}
uint32 seeker;
if (resourceType == kVocabularySCI1)
seeker = 255 * 2; // vocab.900 starts with 255 16-bit pointers which we don't use
else
seeker = 26 * 2; // vocab.000 starts with 26 16-bit pointers which we don't use
if (resource->size < seeker) {
warning("Invalid main vocabulary encountered: Too small");
return false;
// Now this ought to be critical, but it'll just cause parse() and said() not to work
}
_parserWords.clear();
while (seeker < resource->size) {
byte c;
currentWordPos = resource->data[seeker++]; // Parts of previous words may be re-used
if (resourceType == kVocabularySCI1) {
c = 1;
while (seeker < resource->size && currentWordPos < 255 && c) {
c = resource->data[seeker++];
currentWord[currentWordPos++] = c;
}
if (seeker == resource->size) {
warning("SCI1: Vocabulary not usable, disabling");
_parserWords.clear();
return false;
}
} else {
do {
c = resource->data[seeker++];
currentWord[currentWordPos++] = c & 0x7f; // 0x80 is used to terminate the string
} while (c < 0x80);
}
currentWord[currentWordPos] = 0;
// Now decode class and group:
c = resource->data[seeker + 1];
ResultWord newWord;
newWord._class = ((resource->data[seeker]) << 4) | ((c & 0xf0) >> 4);
newWord._group = (resource->data[seeker + 2]) | ((c & 0x0f) << 8);
// SCI01 was the first version to support multiple class/group pairs
// per word, so we clear the list in earlier versions
// in earlier versions.
if (getSciVersion() < SCI_VERSION_01)
_parserWords[currentWord].clear();
// Add this to the list of possible class,group pairs for this word
_parserWords[currentWord].push_back(newWord);
seeker += 3;
}
return true;
}
const char *Vocabulary::getAnyWordFromGroup(int group) {
if (group == VOCAB_MAGIC_NUMBER_GROUP)
return "{number}";
if (group == VOCAB_MAGIC_NOTHING_GROUP)
return "{nothing}";
for (WordMap::const_iterator i = _parserWords.begin(); i != _parserWords.end(); ++i) {
for (ResultWordList::const_iterator j = i->_value.begin(); j != i->_value.end(); ++j)
if (j->_group == group)
return i->_key.c_str();
}
return "{invalid}";
}
bool Vocabulary::loadSuffixes() {
// Determine if we can find a SCI1 suffix vocabulary first
Resource* resource = _resMan->findResource(ResourceId(kResourceTypeVocab, _resourceIdSuffixes), 1);
if (!resource)
return false; // No vocabulary found
uint32 seeker = 1;
while ((seeker < resource->size - 1) && (resource->data[seeker + 1] != 0xff)) {
suffix_t suffix;
int maxSize = resource->size - seeker;
suffix.alt_suffix = (const char *)resource->data + seeker;
suffix.alt_suffix_length = Common::strnlen(suffix.alt_suffix, maxSize);
if (suffix.alt_suffix_length == maxSize) {
error("Vocabulary alt appears truncated for suffix %d in resource %d at %u", _parserSuffixes.size(), resource->getNumber(), seeker);
}
seeker += suffix.alt_suffix_length + 1; // Hit end of string
suffix.result_class = (int16)READ_BE_UINT16(resource->data + seeker);
seeker += 2;
// Beginning of next string - skip leading '*'
seeker++;
maxSize = resource->size - seeker;
suffix.word_suffix = (const char *)resource->data + seeker;
suffix.word_suffix_length = Common::strnlen(suffix.word_suffix, maxSize);
if (suffix.word_suffix_length == maxSize) {
error("Vocabulary word appears truncated for suffix %d in resource %d at %u", _parserSuffixes.size(), resource->getNumber(), seeker);
}
seeker += suffix.word_suffix_length + 1;
suffix.class_mask = (int16)READ_BE_UINT16(resource->data + seeker);
seeker += 3; // Next entry
_parserSuffixes.push_back(suffix);
}
return true;
}
void Vocabulary::freeSuffixes() {
Resource* resource = _resMan->findResource(ResourceId(kResourceTypeVocab, _resourceIdSuffixes), 0);
if (resource)
_resMan->unlockResource(resource);
_parserSuffixes.clear();
}
bool Vocabulary::loadBranches() {
Resource *resource = _resMan->findResource(ResourceId(kResourceTypeVocab, _resourceIdBranches), 0);
_parserBranches.clear();
if (!resource)
return false; // No parser tree data found
int branches_nr = resource->size / 20;
if (branches_nr == 0) {
warning("Parser tree data is empty");
return false;
}
_parserBranches.resize(branches_nr);
for (int i = 0; i < branches_nr; i++) {
byte *base = resource->data + i * 20;
_parserBranches[i].id = (int16)READ_LE_UINT16(base);
for (int k = 0; k < 9; k++)
_parserBranches[i].data[k] = READ_LE_UINT16(base + 2 + 2 * k);
_parserBranches[i].data[9] = 0; // Always terminate
}
if (!_parserBranches[branches_nr - 1].id) // branch lists may be terminated by empty rules
_parserBranches.remove_at(branches_nr - 1);
return true;
}
bool Vocabulary::loadAltInputs() {
Resource *resource = _resMan->findResource(ResourceId(kResourceTypeVocab, VOCAB_RESOURCE_ALT_INPUTS), 1);
if (!resource)
return true; // it's not a problem if this resource doesn't exist
const char *data = (const char*)resource->data;
const char *data_end = data + resource->size;
_altInputs.clear();
_altInputs.resize(256);
while (data < data_end && *data) {
AltInput t;
t._input = data;
uint32 maxSize = data_end - data;
uint32 l = Common::strnlen(data, maxSize);
if (l == maxSize) {
error("Alt input from %d appears truncated at %ld", resource->getNumber(), (byte *)data - resource->data);
}
t._inputLength = l;
data += l + 1;
t._replacement = data;
maxSize = data_end - data;
l = Common::strnlen(data, maxSize);
if (l == maxSize) {
error("Alt input replacement from %d appears truncated at %ld", resource->getNumber(), (byte *)data - resource->data);
}
data += l + 1;
if (data < data_end && strncmp(data, t._input, t._inputLength) == 0)
t._prefix = true;
else
t._prefix = false;
unsigned char firstChar = t._input[0];
_altInputs[firstChar].push_front(t);
}
return true;
}
void Vocabulary::freeAltInputs() {
Resource *resource = _resMan->findResource(ResourceId(kResourceTypeVocab, VOCAB_RESOURCE_ALT_INPUTS), 0);
if (resource)
_resMan->unlockResource(resource);
_altInputs.clear();
}
bool Vocabulary::checkAltInput(Common::String &text, uint16 &cursorPos) {
if (_altInputs.empty())
return false;
if (SELECTOR(parseLang) == -1)
return false;
if (readSelectorValue(g_sci->getEngineState()->_segMan, g_sci->getGameObject(), SELECTOR(parseLang)) == 1)
return false;
bool ret = false;
uint32 loopCount = 0;
bool changed;
do {
changed = false;
const char *t = text.c_str();
uint32 tlen = text.size();
for (uint32 p = 0; p < tlen && !changed; ++p) {
unsigned char s = t[p];
if (s >= _altInputs.size() || _altInputs[s].empty())
continue;
Common::List<AltInput>::iterator i;
for (i = _altInputs[s].begin(); i != _altInputs[s].end(); ++i) {
if (p + i->_inputLength > tlen)
continue;
if (i->_prefix && cursorPos > p && cursorPos <= p + i->_inputLength)
continue;
if (strncmp(i->_input, t+p, i->_inputLength) == 0) {
// replace
const uint32 maxSize = text.size() - cursorPos;
if (cursorPos > p + i->_inputLength) {
cursorPos += Common::strnlen(i->_replacement, maxSize) - i->_inputLength;
} else if (cursorPos > p) {
cursorPos = p + Common::strnlen(i->_replacement, maxSize);
}
for (uint32 j = 0; j < i->_inputLength; ++j)
text.deleteChar(p);
const char *r = i->_replacement;
while (*r)
text.insertChar(*r++, p++);
assert(cursorPos <= text.size());
changed = true;
ret = true;
break;
}
}
}
} while (changed && loopCount++ < 10);
return ret;
}
// we assume that *word points to an already lowercased word
void Vocabulary::lookupWord(ResultWordList& retval, const char *word, int word_len) {
retval.clear();
Common::String tempword(word, word_len);
// Remove all dashes from tempword
for (uint i = 0; i < tempword.size(); ) {
if (tempword[i] == '-')
tempword.deleteChar(i);
else
++i;
}
// Look it up:
WordMap::iterator dict_words = _parserWords.find(tempword);
// Match found? Return it!
if (dict_words != _parserWords.end()) {
retval = dict_words->_value;
// SCI01 was the first version to support
// multiple matches, so no need to look further
// in earlier versions.
// In versions that do support multiple matches, it seems
// that SSCI also aborts early when it finds an exact match in the
// dictionary.
return;
}
// Now try all suffixes
for (SuffixList::const_iterator suffix = _parserSuffixes.begin(); suffix != _parserSuffixes.end(); ++suffix) {
if (suffix->alt_suffix_length <= word_len) {
int suff_index = word_len - suffix->alt_suffix_length;
// Offset of the start of the suffix
if (strncmp(suffix->alt_suffix, word + suff_index, suffix->alt_suffix_length) == 0) { // Suffix matched!
// Terminate word at suffix start position...:
Common::String tempword2(word, MIN(word_len, suff_index));
// ...and append "correct" suffix
tempword2 += Common::String(suffix->word_suffix, suffix->word_suffix_length);
dict_words = _parserWords.find(tempword2);
if (dict_words != _parserWords.end()) {
for (ResultWordList::const_iterator j = dict_words->_value.begin(); j != dict_words->_value.end(); ++j) {
if (j->_class & suffix->class_mask) { // Found it?
// Use suffix class
ResultWord tmp = *j;
tmp._class = suffix->result_class;
retval.push_back(tmp);
// SCI01 was the first version to support
// multiple matches, so no need to look further
// in earlier versions.
if (getSciVersion() < SCI_VERSION_01)
return;
}
}
}
}
}
}
if (!retval.empty())
return;
// No match so far? Check if it's a number.
char *tester;
if ((strtol(tempword.c_str(), &tester, 10) >= 0) && (*tester == '\0')) { // Do we have a complete number here?
ResultWord tmp = { VOCAB_CLASS_NUMBER, VOCAB_MAGIC_NUMBER_GROUP };
retval.push_back(tmp);
}
}
void Vocabulary::debugDecipherSaidBlock(const byte *addr) {
bool first = true;
uint16 nextItem;
do {
nextItem = *addr++;
if (nextItem != 0xff) {
if ((!first) && (nextItem != 0xf0))
debugN(" ");
first = false;
if (nextItem < 0xf0) {
nextItem = nextItem << 8 | *addr++;
debugN("%s{%03x}", getAnyWordFromGroup(nextItem), nextItem);
nextItem = 0; // Make sure that group 0xff doesn't abort
} else switch (nextItem) {
case 0xf0:
debugN(",");
break;
case 0xf1:
debugN("&");
break;
case 0xf2:
debugN("/");
break;
case 0xf3:
debugN("(");
break;
case 0xf4:
debugN(")");
break;
case 0xf5:
debugN("[");
break;
case 0xf6:
debugN("]");
break;
case 0xf7:
debugN("#");
break;
case 0xf8:
debugN("<");
break;
case 0xf9:
debugN(">");
break;
}
}
} while (nextItem != 0xff);
}
static const byte lowerCaseMap[256] = {
0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, // 0x00
0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, // 0x10
0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f, // 0x20
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f, // 0x30
0x40, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', // 0x40
'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 0x5b, 0x5c, 0x5d, 0x5e, 0x5f, // 0x50
0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f, // 0x60
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, 0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f, // 0x70
0x87, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87, 0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x84, 0x86, // 0x80
//^^ ^^^^ ^^^^
0x82, 0x91, 0x91, 0x93, 0x94, 0x95, 0x96, 0x97, 0x98, 0x94, 0x81, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f, // 0x90
//^^ ^^^^ ^^^^ ^^^^
0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa4, 0xa6, 0xa7, 0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf, // 0xa0
// ^^^^
0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, 0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, // 0xb0
0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, 0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, // 0xc0
0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0xd9, 0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf, // 0xd0
0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, // 0xe0
0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, 0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff // 0xf0
};
bool Vocabulary::tokenizeString(ResultWordListList &retval, const char *sentence, char **error) {
char currentWord[VOCAB_MAX_WORDLENGTH] = "";
int pos_in_sentence = 0;
unsigned char c;
int wordLen = 0;
*error = NULL;
do {
c = sentence[pos_in_sentence++];
if (Common::isAlnum(c) || (c == '-' && wordLen) || (c >= 0x80)) {
currentWord[wordLen] = lowerCaseMap[c];
++wordLen;
} else if (c == ' ' || c == '\0') {
// Continue on this word. Words may contain a '-', but may not start with
// one.
if (wordLen) { // Finished a word?
ResultWordList lookup_result;
// Look it up
lookupWord(lookup_result, currentWord, wordLen);
if (lookup_result.empty()) { // Not found?
*error = (char *)calloc(wordLen + 1, 1);
strncpy(*error, currentWord, wordLen); // Set the offending word
retval.clear();
return false; // And return with error
}
// Copy into list
retval.push_back(lookup_result);
}
wordLen = 0;
}
} while (c); // Until terminator is hit
return true;
}
void Vocabulary::printSuffixes() const {
char word_buf[VOCAB_MAX_WORDLENGTH], alt_buf[VOCAB_MAX_WORDLENGTH];
Console *con = g_sci->getSciDebugger();
int i = 0;
for (SuffixList::const_iterator suf = _parserSuffixes.begin(); suf != _parserSuffixes.end(); ++suf) {
strncpy(word_buf, suf->word_suffix, suf->word_suffix_length);
word_buf[suf->word_suffix_length] = 0;
strncpy(alt_buf, suf->alt_suffix, suf->alt_suffix_length);
alt_buf[suf->alt_suffix_length] = 0;
con->debugPrintf("%4d: (%03x) -%12s => -%12s (%03x)\n", i, suf->class_mask, word_buf, alt_buf, suf->result_class);
++i;
}
}
void Vocabulary::printParserWords() const {
Console *con = g_sci->getSciDebugger();
int n = 0;
for (WordMap::iterator i = _parserWords.begin(); i != _parserWords.end(); ++i) {
for (ResultWordList::iterator j = i->_value.begin(); j != i->_value.end(); ++j) {
con->debugPrintf("%4d: %03x [%03x] %20s |", n, j->_class, j->_group, i->_key.c_str());
if (n % 3 == 0)
con->debugPrintf("\n");
n++;
}
}
con->debugPrintf("\n");
}
void _vocab_recursive_ptree_dump(ParseTreeNode *tree, int blanks) {
assert(tree);
ParseTreeNode* lbranch = tree->left;
ParseTreeNode* rbranch = tree->right;
int i;
if (tree->type == kParseTreeLeafNode) {
debugN("vocab_dump_parse_tree: Error: consp is nil\n");
return;
}
if (lbranch) {
if (lbranch->type == kParseTreeBranchNode) {
debugN("\n");
for (i = 0; i < blanks; i++)
debugN(" ");
debugN("(");
_vocab_recursive_ptree_dump(lbranch, blanks + 1);
debugN(")\n");
for (i = 0; i < blanks; i++)
debugN(" ");
} else
debugN("%x", lbranch->value);
debugN(" ");
}/* else debugN ("nil");*/
if (rbranch) {
if (rbranch->type == kParseTreeBranchNode)
_vocab_recursive_ptree_dump(rbranch, blanks);
else {
debugN("%x", rbranch->value);
while (rbranch->right) {
rbranch = rbranch->right;
debugN("/%x", rbranch->value);
}
}
}/* else debugN("nil");*/
}
void vocab_dump_parse_tree(const char *tree_name, ParseTreeNode *nodes) {
debugN("(setq %s \n'(", tree_name);
_vocab_recursive_ptree_dump(nodes, 1);
debugN("))\n");
}
void Vocabulary::dumpParseTree() {
debugN("(setq parse-tree \n'(");
_vocab_recursive_ptree_dump(_parserNodes, 1);
debugN("))\n");
}
void Vocabulary::synonymizeTokens(ResultWordListList &words) {
if (_synonyms.empty())
return; // No synonyms: Nothing to check
for (ResultWordListList::iterator i = words.begin(); i != words.end(); ++i)
for (ResultWordList::iterator j = i->begin(); j != i->end(); ++j)
for (SynonymList::const_iterator sync = _synonyms.begin(); sync != _synonyms.end(); ++sync)
if (j->_group == sync->replaceant)
j->_group = sync->replacement;
}
void Vocabulary::printParserNodes(int num) {
Console *con = g_sci->getSciDebugger();
for (int i = 0; i < num; i++) {
con->debugPrintf(" Node %03x: ", i);
if (_parserNodes[i].type == kParseTreeLeafNode)
con->debugPrintf("Leaf: %04x\n", _parserNodes[i].value);
else {
// FIXME: Do we really want to print the *addresses*
// of the left & right child?
// Note that one or both may be zero pointers, so we can't just
// print their values.
con->debugPrintf("Branch: ->%p, ->%p\n",
(const void *)_parserNodes[i].left,
(const void *)_parserNodes[i].right);
}
}
}
int Vocabulary::parseNodes(int *i, int *pos, int type, int nr, int argc, const char **argv) {
int nextToken = 0, nextValue = 0, newPos = 0, oldPos = 0;
Console *con = g_sci->getSciDebugger();
if (type == kParseNil)
return 0;
if (type == kParseNumber) {
_parserNodes[*pos += 1].type = kParseTreeLeafNode;
_parserNodes[*pos].value = nr;
_parserNodes[*pos].right = 0;
return *pos;
}
if (type == kParseEndOfInput) {
con->debugPrintf("Unbalanced parentheses\n");
return -1;
}
if (type == kParseClosingParenthesis) {
con->debugPrintf("Syntax error at token %d\n", *i);
return -1;
}
_parserNodes[oldPos = ++(*pos)].type = kParseTreeBranchNode;
for (int j = 0; j <= 1; j++) {
if (*i == argc) {
nextToken = kParseEndOfInput;
} else {
const char *token = argv[(*i)++];
if (!strcmp(token, "(")) {
nextToken = kParseOpeningParenthesis;
} else if (!strcmp(token, ")")) {
nextToken = kParseClosingParenthesis;
} else if (!strcmp(token, "nil")) {
nextToken = kParseNil;
} else {
nextValue = strtol(token, NULL, 0);
nextToken = kParseNumber;
}
}
newPos = parseNodes(i, pos, nextToken, nextValue, argc, argv);
if (newPos == -1)
return -1;
if (j == 0)
_parserNodes[oldPos].left = &_parserNodes[newPos];
else
_parserNodes[oldPos].right = &_parserNodes[newPos];
}
const char *token = argv[(*i)++];
if (strcmp(token, ")"))
con->debugPrintf("Expected ')' at token %d\n", *i);
return oldPos;
}
// FIXME: Duplicated from said.cpp
static int node_major(ParseTreeNode* node) {
assert(node->type == kParseTreeBranchNode);
assert(node->left->type == kParseTreeLeafNode);
return node->left->value;
}
static bool node_is_terminal(ParseTreeNode* node) {
return (node->right->right &&
node->right->right->type != kParseTreeBranchNode);
}
static int node_terminal_value(ParseTreeNode* node) {
assert(node_is_terminal(node));
return node->right->right->value;
}
static ParseTreeNode* scanForMajor(ParseTreeNode *tree, int major) {
assert(tree);
if (node_is_terminal(tree)) {
if (node_major(tree) == major)
return tree;
else
return 0;
}
ParseTreeNode* ptr = tree->right;
// Scan children
while (ptr->right) {
ptr = ptr->right;
if (node_major(ptr->left) == major)
return ptr->left;
}
if (major == 0x141)
return 0;
// If not found, go into a 0x141 and try again
tree = scanForMajor(tree, 0x141);
if (!tree)
return 0;
return scanForMajor(tree, major);
}
bool Vocabulary::storePronounReference() {
assert(parserIsValid);
ParseTreeNode *ptr = scanForMajor(_parserNodes, 0x142); // 0x142 = object?
while (ptr && !node_is_terminal(ptr))
ptr = scanForMajor(ptr, 0x141);
if (!ptr)
return false;
_pronounReference = node_terminal_value(ptr);
debugC(kDebugLevelParser, "Stored pronoun reference: %x", _pronounReference);
return true;
}
void Vocabulary::replacePronouns(ResultWordListList &words) {
if (_pronounReference == 0x1000)
return;
for (ResultWordListList::iterator i = words.begin(); i != words.end(); ++i)
for (ResultWordList::iterator j = i->begin(); j != i->end(); ++j)
if (j->_class & (VOCAB_CLASS_PRONOUN << 4)) {
j->_class = VOCAB_CLASS_NOUN << 4;
j->_group = _pronounReference;
}
}
} // End of namespace Sci
|