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
|
/* 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.
*
* $URL$
* $Id$
*
*/
#ifndef SCI_SCICORE_VOCABULARY_H
#define SCI_SCICORE_VOCABULARY_H
#include "common/str.h"
#include "common/hashmap.h"
#include "common/hash-str.h"
#include "common/list.h"
#include "sci/sci.h"
#include "sci/engine/vm_types.h"
namespace Sci {
class ResourceManager;
/*#define VOCABULARY_DEBUG */
enum {
VOCAB_RESOURCE_SELECTORS = 997,
VOCAB_RESOURCE_SCI0_MAIN_VOCAB = 0,
VOCAB_RESOURCE_SCI0_PARSE_TREE_BRANCHES = 900,
VOCAB_RESOURCE_SCI0_SUFFIX_VOCAB = 901,
VOCAB_RESOURCE_SCI1_MAIN_VOCAB = 900,
VOCAB_RESOURCE_SCI1_PARSE_TREE_BRANCHES = 901,
VOCAB_RESOURCE_SCI1_SUFFIX_VOCAB = 902
};
enum {
VOCAB_CLASS_PREPOSITION = 0x01,
VOCAB_CLASS_ARTICLE = 0x02,
VOCAB_CLASS_ADJECTIVE = 0x04,
VOCAB_CLASS_PRONOUN = 0x08,
VOCAB_CLASS_NOUN = 0x10,
VOCAB_CLASS_INDICATIVE_VERB = 0x20,
VOCAB_CLASS_ADVERB = 0x40,
VOCAB_CLASS_IMPERATIVE_VERB = 0x80,
VOCAB_CLASS_NUMBER = 0x001
};
enum {
kParseEndOfInput = 0,
kParseOpeningParenthesis = 1,
kParseClosingParenthesis = 2,
kParseNil = 3,
kParseNumber = 4
};
#define VOCAB_MAX_WORDLENGTH 256
/* Anywords are ignored by the parser */
#define VOCAB_CLASS_ANYWORD 0xff
/* This word class is used for numbers */
#define VOCAB_MAGIC_NUMBER_GROUP 0xffd /* 0xffe ? */
#define VOCAB_MAGIC_NOTHING_GROUP 0xffe
/* Number of nodes for each ParseTreeNode structure */
#define VOCAB_TREE_NODES 500
#define VOCAB_TREE_NODE_LAST_WORD_STORAGE 0x140
#define VOCAB_TREE_NODE_COMPARE_TYPE 0x146
#define VOCAB_TREE_NODE_COMPARE_GROUP 0x14d
#define VOCAB_TREE_NODE_FORCE_STORAGE 0x154
#define SAID_COMMA 0xf0
#define SAID_AMP 0xf1
#define SAID_SLASH 0xf2
#define SAID_PARENO 0xf3
#define SAID_PARENC 0xf4
#define SAID_BRACKO 0xf5
#define SAID_BRACKC 0xf6
#define SAID_HASH 0xf7
#define SAID_LT 0xf8
#define SAID_GT 0xf9
#define SAID_TERM 0xff
#define SAID_FIRST SAID_COMMA
/* There was no 'last matching word': */
#define SAID_FULL_MATCH 0xffff
#define SAID_NO_MATCH 0xfffe
#define SAID_PARTIAL_MATCH 0xfffd
#define SAID_LONG(x) ((x) << 8)
struct ResultWord {
int _class; /**< Word class */
int _group; /**< Word group */
};
typedef Common::List<ResultWord> ResultWordList;
typedef Common::List<ResultWordList> ResultWordListList;
typedef Common::HashMap<Common::String, ResultWordList, Common::CaseSensitiveString_Hash, Common::CaseSensitiveString_EqualTo> WordMap;
struct ParseRuleList;
struct suffix_t {
int class_mask; /**< the word class this suffix applies to */
int result_class; /**< the word class a word is morphed to if it doesn't fail this check */
int alt_suffix_length; /**< String length of the suffix */
int word_suffix_length; /**< String length of the other suffix */
const char *alt_suffix; /**< The alternative suffix */
const char *word_suffix; /**< The suffix as used in the word vocabulary */
};
typedef Common::List<suffix_t> SuffixList;
struct synonym_t {
int replaceant; /**< The word group to replace */
int replacement; /**< The replacement word group for this one */
};
typedef Common::List<synonym_t> SynonymList;
struct parse_tree_branch_t {
int id;
int data[10];
};
enum ParseTypes {
kParseTreeWordNode = 4,
kParseTreeLeafNode = 5,
kParseTreeBranchNode = 6
};
struct ParseTreeNode {
ParseTypes type; /**< leaf or branch */
int value; /**< For leaves */
ParseTreeNode* left; /**< Left child, for branches */
ParseTreeNode* right; /**< Right child, for branches (and word leaves) */
};
enum VocabularyVersions {
kVocabularySCI0 = 0,
kVocabularySCI1 = 1
};
class Vocabulary {
public:
Vocabulary(ResourceManager *resMan, bool foreign);
~Vocabulary();
// reset parser status
void reset();
/**
* Gets any word from the specified group. For debugging only.
* @param group Group number
*/
const char *getAnyWordFromGroup(int group);
/**
* Looks up a single word in the words and suffixes list.
* @param retval the list of matches
* @param word pointer to the word to look up
* @param word_len length of the word to look up
*/
void lookupWord(ResultWordList &retval, const char *word, int word_len);
/**
* Tokenizes a string and compiles it into word_ts.
* @param[in] retval A list of words which will be set to the result
* @param[out] sentence The sentence to examine
* @param[out] error Points to a malloc'd copy of the offending text or to NULL on error
* @return true on success, false on failure
*
* On error, false is returned. If *error is NULL, the sentence did not
* contain any useful words; if not, *error points to a malloc'd copy of
* the offending word. The returned list may contain anywords.
*/
bool tokenizeString(ResultWordListList &retval, const char *sentence, char **error);
/**
* Builds a parse tree from a list of words, using a set of Greibach Normal
* Form rules.
* @param words The words to build the tree from
* @param verbose Set to true for debugging
* @return 0 on success, 1 if the tree couldn't be built in VOCAB_TREE_NODES
* nodes or if the sentence structure in 'words' is not part of the
* language described by the grammar passed in 'rules'.
*/
int parseGNF(const ResultWordListList &words, bool verbose = false);
/**
* Constructs the Greibach Normal Form of the grammar supplied in 'branches'.
* @param verbose Set to true for debugging. If true, the list is
* freed before the function ends
* @return Pointer to a list of singly linked GNF rules describing the same
* language that was described by 'branches'
*
* The original SCI rules are in almost-CNF (Chomsky Normal Form). Note that
* branch[0] is used only for a few magical incantations, as it is treated
* specially by the SCI parser.
*/
ParseRuleList *buildGNF(bool verbose = false);
/**
* Deciphers a said block and dumps its content via printf.
* For debugging only.
* @param pos pointer to the data to dump
*/
void debugDecipherSaidBlock(const byte *pos);
/**
* Prints the parser suffixes to the debug console.
*/
void printSuffixes() const;
/**
* Prints the parser words to the debug console.
*/
void printParserWords() const;
uint getParserBranchesSize() const { return _parserBranches.size(); }
const parse_tree_branch_t &getParseTreeBranch(int number) const { return _parserBranches[number]; }
/**
* Adds a new synonym to the list
*/
void addSynonym(synonym_t syn) { _synonyms.push_back(syn); }
/**
* Clears the list of synonyms
*/
void clearSynonyms() { _synonyms.clear(); }
/**
* Synonymizes a token list
* Parameters: (ResultWordListList &) words: The word list to synonymize
*/
void synonymizeTokens(ResultWordListList &words);
void printParserNodes(int num);
void dumpParseTree();
int parseNodes(int *i, int *pos, int type, int nr, int argc, const char **argv);
private:
/**
* Loads all words from the main vocabulary.
* @return true on success, false on failure
*/
bool loadParserWords();
/**
* Loads all suffixes from the suffix vocabulary.
* @return true on success, false on failure
*/
bool loadSuffixes();
/**
* Frees all suffixes in the given list.
* @param suffixes: The suffixes to free
*/
void freeSuffixes();
/**
* Retrieves all grammar rules from the resource data.
* @param branches The rules are stored into this Array
* @return true on success, false on error
*/
bool loadBranches();
/**
* Frees a parser rule list as returned by vocab_build_gnf().
* @param rule_list the rule list to free
*/
void freeRuleList(ParseRuleList *rule_list);
ResourceManager *_resMan;
VocabularyVersions _vocabVersion;
bool _foreign;
uint16 _resourceIdWords;
uint16 _resourceIdSuffixes;
uint16 _resourceIdBranches;
// Parser-related lists
SuffixList _parserSuffixes;
ParseRuleList *_parserRules; /**< GNF rules used in the parser algorithm */
Common::Array<parse_tree_branch_t> _parserBranches;
WordMap _parserWords;
SynonymList _synonyms; /**< The list of synonyms */
public:
// Accessed by said()
ParseTreeNode _parserNodes[VOCAB_TREE_NODES]; /**< The parse tree */
// Parser data:
reg_t parser_base; /**< Base address for the parser error reporting mechanism */
reg_t parser_event; /**< The event passed to Parse() and later used by Said() */
bool parserIsValid; /**< If something has been correctly parsed */
};
/**
* Prints a parse tree.
* @param tree_name Name of the tree to dump (free-form)
* @param nodes The nodes containing the parse tree
*/
void vocab_dump_parse_tree(const char *tree_name, ParseTreeNode *nodes);
/**
* Builds a parse tree from a spec and compares it to a parse tree.
* @param s The affected state
* @param spec Pointer to the spec to build
* @param verbose Whether to display the parse tree after building it
* @return 1 on a match, 0 otherwise
*/
int said(EngineState *s, const byte *spec, bool verbose);
} // End of namespace Sci
#endif // SCI_SCICORE_VOCABULARY_H
|