-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtext.c
1097 lines (786 loc) · 20.5 KB
/
text.c
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
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* text.c - Text manipulation functions
* Copyright (c) 1995-1997 Stefan Jokisch
*
* This file is part of Frotz.
*
* Frotz 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.
*
* Frotz 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 "frotz.h"
enum string_type {
LOW_STRING, ABBREVIATION, HIGH_STRING, EMBEDDED_STRING, VOCABULARY
};
extern zword A00296 (zword);
static zchar decoded[10];
static zword encoded[3];
/*
* According to Matteo De Luigi <[email protected]>,
* 0xab and 0xbb were in each other's proper positions.
* Sat Apr 21, 2001
*/
static zchar zscii_to_latin1[] = {
0xe4, 0xf6, 0xfc, 0xc4, 0xd6, 0xdc, 0xdf, 0xbb,
0xab, 0xeb, 0xef, 0xff, 0xcb, 0xcf, 0xe1, 0xe9,
0xed, 0xf3, 0xfa, 0xfd, 0xc1, 0xc9, 0xcd, 0xd3,
0xda, 0xdd, 0xe0, 0xe8, 0xec, 0xf2, 0xf9, 0xc0,
0xc8, 0xcc, 0xd2, 0xd9, 0xe2, 0xea, 0xee, 0xf4,
0xfb, 0xc2, 0xca, 0xce, 0xd4, 0xdb, 0xe5, 0xc5,
0xf8, 0xd8, 0xe3, 0xf1, 0xf5, 0xc3, 0xd1, 0xd5,
0xe6, 0xc6, 0xe7, 0xc7, 0xfe, 0xf0, 0xde, 0xd0,
0xa3, 0xf6, 0xd6, 0xa1, 0xbf
};
/*
* A00192
*
* Map a ZSCII character onto the ISO Latin-1 alphabet.
*
*/
zchar A00192 (zbyte c)
{
if (c == 0xfc)
return ZC_MENU_CLICK;
if (c == 0xfd)
return ZC_DOUBLE_CLICK;
if (c == 0xfe)
return ZC_SINGLE_CLICK;
if (c >= 0x9b && A00075 != BEYOND_ZORK) {
if (A00071 != 0) { /* game has its own Unicode table */
zbyte N;
LOW_BYTE (A00071, N)
if (c - 0x9b < N) {
zword addr = A00071 + 1 + 2 * (c - 0x9b);
zword unicode;
LOW_WORD (addr, unicode)
return (unicode < 0x100) ? (zchar) unicode : '?';
} else return '?';
} else /* game uses standard set */
if (c <= 0xdf) {
#ifndef HANDLE_OE_DIPTHONG
if (c == 0xdc || c == 0xdd) /* Oe and oe ligatures */
return '?'; /* are not ISO-Latin 1 */
#endif /* HANDLE_OE_DIPTHONG */
return zscii_to_latin1[c - 0x9b];
} else return '?';
}
return c;
}/* A00192 */
/*
* A00193
*
* Map an ISO Latin-1 character onto the ZSCII alphabet.
*
*/
zbyte A00193 (zchar c)
{
int i;
if (c == ZC_SINGLE_CLICK)
return 0xfe;
if (c == ZC_DOUBLE_CLICK)
return 0xfd;
if (c == ZC_MENU_CLICK)
return 0xfc;
if (c >= ZC_LATIN1_MIN) {
if (A00071 != 0) { /* game has its own Unicode table */
zbyte N;
int i;
LOW_BYTE (A00071, N)
for (i = 0x9b; i < 0x9b + N; i++) {
zword addr = A00071 + 1 + 2 * (i - 0x9b);
zword unicode;
LOW_WORD (addr, unicode)
if (c == unicode)
return (zbyte) i;
}
return '?';
} else { /* game uses standard set */
for (i = 0x9b; i <= 0xdf; i++)
if (c == zscii_to_latin1[i - 0x9b])
return (zbyte) i;
return '?';
}
}
if (c == 0) /* Safety thing from David Kinder */
c = '?'; /* regarding his Unicode patches */
/* Sept 15, 2002 */
return c;
}/* A00193 */
/*
* alphabet
*
* Return a character from one of the three character sets.
*
*/
static zchar alphabet (int set, int index)
{
if (A00065 != 0) { /* game uses its own alphabet */
zbyte c;
zword addr = A00065 + 26 * set + index;
LOW_BYTE (addr, c)
return A00192 (c);
} else /* game uses default alphabet */
if (set == 0)
return 'a' + index;
else if (set == 1)
return 'A' + index;
else if (A00035 == V1)
return " 0123456789.,!?_#'\"/\\<-:()"[index];
else
return " ^0123456789.,!?_#'\"/\\-:()"[index];
}/* alphabet */
/*
* load_string
*
* Copy a ZSCII string from the memory to the global "decoded" string.
*
*/
static void load_string (zword addr, zword length)
{
int resolution = (A00035 <= V3) ? 2 : 3;
int i = 0;
while (i < 3 * resolution)
if (i < length) {
zbyte c;
LOW_BYTE (addr, c)
addr++;
decoded[i++] = A00192 (c);
} else decoded[i++] = 0;
}/* load_string */
/*
* encode_text
*
* Encode the Unicode text in the global "decoded" string then write
* the result to the global "encoded" array. (This is used to look up
* words in the dictionary.) Up to V3 the vocabulary resolution is
* two, since V4 it is three words. Because each word contains three
* Z-characters, that makes six or nine Z-characters respectively.
* Longer words are chopped to the proper size, shorter words are are
* padded out with 5's. For word A00206 we pad with 0s and 31s,
* the minimum and maximum Z-characters.
*
*/
static void encode_text (int padding)
{
static zchar again[] = { 'a', 'g', 'a', 'i', 'n', 0 };
static zchar examine[] = { 'e', 'x', 'a', 'm', 'i', 'n', 'e', 0 };
static zchar wait[] = { 'w', 'a', 'i', 't', 0 };
zbyte zchars[12];
const zchar *ptr = decoded;
zchar c;
int resolution = (A00035 <= V3) ? 2 : 3;
int i = 0;
/* Expand abbreviations that some old Infocom games lack */
if (A00003.expand_abbreviations)
if (padding == 0x05 && decoded[1] == 0)
switch (decoded[0]) {
case 'g': ptr = again; break;
case 'x': ptr = examine; break;
case 'z': ptr = wait; break;
}
/* Translate string to a sequence of Z-characters */
while (i < 3 * resolution)
if ((c = *ptr++) != 0) {
int index, set;
zbyte c2;
/* Search character in the alphabet */
for (set = 0; set < 3; set++)
for (index = 0; index < 26; index++)
if (c == alphabet (set, index))
goto letter_found;
/* Character not found, store its ZSCII value */
c2 = A00193 (c);
zchars[i++] = 5;
zchars[i++] = 6;
zchars[i++] = c2 >> 5;
zchars[i++] = c2 & 0x1f;
continue;
letter_found:
/* Character found, store its index */
if (set != 0)
zchars[i++] = ((A00035 <= V2) ? 1 : 3) + set;
zchars[i++] = index + 6;
} else zchars[i++] = padding;
/* Three Z-characters make a 16bit word */
for (i = 0; i < resolution; i++)
encoded[i] =
(zchars[3 * i + 0] << 10) |
(zchars[3 * i + 1] << 5) |
(zchars[3 * i + 2]);
encoded[resolution - 1] |= 0x8000;
}/* encode_text */
/*
* A00101, test if a unicode character can be read and printed.
*
* zargs[0] = Unicode
*
*/
void A00101 (void)
{
zword c = zargs[0];
if (c >= 0x20 && c <= 0x7e)
store (3);
else if (c == 0xa0)
store (1);
else if (c >= 0xa1 && c <= 0xff)
store (3);
else
store (0);
}/* A00101 */
/*
* A00106, encode a ZSCII string for use in a dictionary.
*
* zargs[0] = address of text buffer
* zargs[1] = length of ASCII string
* zargs[2] = offset of ASCII string within the text buffer
* zargs[3] = address to store encoded text in
*
* This is a V5+ opcode and therefore the dictionary resolution must be
* three 16bit words.
*
*/
void A00106 (void)
{
int i;
load_string ((zword) (zargs[0] + zargs[2]), zargs[1]);
encode_text (0x05);
for (i = 0; i < 3; i++)
A00204 ((zword) (zargs[3] + 2 * i), encoded[i]);
}/* A00106 */
/*
* decode_text
*
* Convert encoded text to Unicode. The encoded text consists of 16bit
* words. Every word holds 3 Z-characters (5 bits each) plus a spare
* bit to mark the last word. The Z-characters translate to ZSCII by
* looking at the current current character set. Some select another
* character set, others refer to abbreviations.
*
* There are several different string types:
*
* LOW_STRING - from the lower 64KB (byte address)
* ABBREVIATION - from the abbreviations table (word address)
* HIGH_STRING - from the end of the memory map (packed address)
* EMBEDDED_STRING - from the instruction stream (at PC)
* VOCABULARY - from the dictionary (byte address)
*
* The last type is only used for word A00206.
*
*/
#define outchar(c) if (st==VOCABULARY) *ptr++=c; else A00196(c)
static void decode_text (enum string_type st, zword addr)
{
zchar *ptr;
long byte_addr;
zchar c2;
zword code;
zbyte c, prev_c = 0;
int shift_state = 0;
int shift_lock = 0;
int status = 0;
ptr = NULL; /* makes compilers shut up */
byte_addr = 0;
/* Calculate the byte address if necessary */
if (st == ABBREVIATION)
byte_addr = (long) addr << 1;
else if (st == HIGH_STRING) {
if (A00035 <= V3)
byte_addr = (long) addr << 1;
else if (A00035 <= V5)
byte_addr = (long) addr << 2;
else if (A00035 <= V7)
byte_addr = ((long) addr << 2) + ((long) A00058 << 3);
else /* A00035 == V8 */
byte_addr = (long) addr << 3;
if (byte_addr >= A00076)
A00188 (ERR_ILL_PRINT_ADDR);
}
/* Loop until a 16bit word has the highest bit set */
if (st == VOCABULARY)
ptr = decoded;
do {
int i;
/* Fetch the next 16bit word */
if (st == LOW_STRING || st == VOCABULARY) {
LOW_WORD (addr, code)
addr += 2;
} else if (st == HIGH_STRING || st == ABBREVIATION) {
HIGH_WORD (byte_addr, code)
byte_addr += 2;
} else
CODE_WORD (code)
/* Read its three Z-characters */
for (i = 10; i >= 0; i -= 5) {
zword abbr_addr;
zword ptr_addr;
c = (code >> i) & 0x1f;
switch (status) {
case 0: /* normal operation */
if (shift_state == 2 && c == 6)
status = 2;
else if (A00035 == V1 && c == 1)
A00195 ();
else if (A00035 >= V2 && shift_state == 2 && c == 7)
A00195 ();
else if (c >= 6)
outchar (alphabet (shift_state, c - 6));
else if (c == 0)
outchar (' ');
else if (A00035 >= V2 && c == 1)
status = 1;
else if (A00035 >= V3 && c <= 3)
status = 1;
else {
shift_state = (shift_lock + (c & 1) + 1) % 3;
if (A00035 <= V2 && c >= 4)
shift_lock = shift_state;
break;
}
shift_state = shift_lock;
break;
case 1: /* abbreviation */
ptr_addr = A00046 + 64 * (prev_c - 1) + 2 * c;
LOW_WORD (ptr_addr, abbr_addr)
decode_text (ABBREVIATION, abbr_addr);
status = 0;
break;
case 2: /* ZSCII character - first part */
status = 3;
break;
case 3: /* ZSCII character - second part */
c2 = A00192 ((prev_c << 5) | c);
outchar (c2);
status = 0;
break;
}
prev_c = c;
}
} while (!(code & 0x8000));
if (st == VOCABULARY)
*ptr = 0;
}/* decode_text */
#undef outchar
/*
* A00130, print a new line.
*
* no zargs used
*
*/
void A00130 (void)
{
A00195 ();
}/* A00130 */
/*
* A00136, print a string embedded in the instruction stream.
*
* no zargs used
*
*/
void A00136 (void)
{
decode_text (EMBEDDED_STRING, 0);
}/* A00136 */
/*
* A00137, print a string from the lower 64KB.
*
* zargs[0] = address of string to print
*
*/
void A00137 (void)
{
decode_text (LOW_STRING, zargs[0]);
}/* A00137 */
/*
* A00138 print a single ZSCII character.
*
* zargs[0] = ZSCII character to be printed
*
*/
void A00138 (void)
{
A00196 (A00192 (zargs[0]));
}/* A00138 */
/*
* A00139, print a formatted table.
*
* zargs[0] = address of formatted table to be printed
*
*/
void A00139 (void)
{
zword count;
zword addr = zargs[0];
bool first = TRUE;
for (;;) {
LOW_WORD (addr, count)
addr += 2;
if (count == 0)
break;
if (!first)
A00195 ();
while (count--) {
zbyte c;
LOW_BYTE (addr, c)
addr++;
A00196 (A00192 (c));
}
first = FALSE;
}
}/* A00139 */
/*
* A00197
*
* Print a signed 16bit number.
*
*/
void A00197 (zword value)
{
int i;
/* Print sign */
if (A00247( value ) < 0) {
A00196 ('-');
value = - A00247( value );
}
/* Print absolute value */
for (i = 10000; i != 0; i /= 10)
if (value >= i || i == 1)
A00196 ('0' + (value / i) % 10);
}/* A00197 */
/*
* A00140, print a signed number.
*
* zargs[0] = number to print
*
*/
void A00140 (void)
{
A00197 (zargs[0]);
}/* A00140 */
/*
* A00198
*
* Print an object description.
*
*/
void A00198 (zword object)
{
zword addr = A00296 (object);
zword code = 0x94a5;
zbyte length;
LOW_BYTE (addr, length)
addr++;
if (length != 0)
LOW_WORD (addr, code)
if (code == 0x94a5) { /* encoded text 0x94a5 == empty string */
A00199 ("object#"); /* supply a generic name */
A00197 (object); /* for anonymous objects */
} else decode_text (LOW_STRING, addr);
}/* A00198 */
/*
* A00141, print an object description.
*
* zargs[0] = number of object to be printed
*
*/
void A00141 (void)
{
A00198 (zargs[0]);
}/* A00141 */
/*
* A00142, print the string at the given packed address.
*
* zargs[0] = packed address of string to be printed
*
*/
void A00142 (void)
{
decode_text (HIGH_STRING, zargs[0]);
}/* A00142 */
/*
* A00143, print the string at PC, print newline then return true.
*
* no zargs used
*
*/
void A00143 (void)
{
decode_text (EMBEDDED_STRING, 0);
A00195 ();
ret (1);
}/* A00143 */
/*
* A00199
*
* Print a string of ASCII characters.
*
*/
void A00199 (const char *s)
{
char c;
while ((c = *s++) != 0)
if (c == '\n')
A00195 ();
else
A00196 (c);
}/* A00199 */
/*
* A00145
*
* zargs[0] = Unicode
*
*/
void A00145 (void)
{
A00196 ((zargs[0] <= 0xff) ? zargs[0] : '?');
}/* A00145 */
/*
* lookup_text
*
* Scan a dictionary searching for the given word. The first argument
* can be
*
* 0x00 - find the first word which is >= the given one
* 0x05 - find the word which exactly matches the given one
* 0x1f - find the last word which is <= the given one
*
* The return value is 0 if the search fails.
*
*/
static zword lookup_text (int padding, zword dct)
{
zword entry_addr;
zword entry_count;
zword entry;
zword addr;
zbyte entry_len;
zbyte sep_count;
int resolution = (A00035 <= V3) ? 2 : 3;
int entry_number;
int lower, upper;
int i;
bool sorted;
encode_text (padding);
LOW_BYTE (dct, sep_count) /* skip word separators */
dct += 1 + sep_count;
LOW_BYTE (dct, entry_len) /* get length of entries */
dct += 1;
LOW_WORD (dct, entry_count) /* get number of entries */
dct += 2;
if (A00247( entry_count ) < 0) { /* bad luck, entries aren't sorted */
entry_count = - A00247( entry_count );
sorted = FALSE;
} else sorted = TRUE; /* entries are sorted */
lower = 0;
upper = entry_count - 1;
while (lower <= upper) {
if (sorted) /* binary search */
entry_number = (lower + upper) / 2;
else /* linear search */
entry_number = lower;
entry_addr = dct + entry_number * entry_len;
/* Compare word to dictionary entry */
addr = entry_addr;
for (i = 0; i < resolution; i++) {
LOW_WORD (addr, entry)
if (encoded[i] != entry)
goto continuing;
addr += 2;
}
return entry_addr; /* exact match found, return now */
continuing:
if (sorted) /* binary search */
if (encoded[i] > entry)
lower = entry_number + 1;
else
upper = entry_number - 1;
else lower++; /* linear search */
}
/* No exact match has been found */
if (padding == 0x05)
return 0;
entry_number = (padding == 0x00) ? lower : upper;
if (entry_number == -1 || entry_number == entry_count)
return 0;
return dct + entry_number * entry_len;
}/* lookup_text */
/*
* tokenise_text
*
* Translate a single word to a token and append it to the token
* buffer. Every token consists of the address of the dictionary
* entry, the length of the word and the offset of the word from
* the start of the text buffer. Unknown words cause empty slots
* if the flag is set (such that the text can be scanned several
* times with different dictionaries); otherwise they are zero.
*
*/
static void tokenise_text (zword text, zword length, zword from, zword parse, zword dct, bool flag)
{
zword addr;
zbyte token_max, token_count;
LOW_BYTE (parse, token_max)
parse++;
LOW_BYTE (parse, token_count)
if (token_count < token_max) { /* sufficient space left for token? */
A00203 (parse++, token_count + 1);
load_string ((zword) (text + from), length);
addr = lookup_text (0x05, dct);
if (addr != 0 || !flag) {
parse += 4 * token_count;
A00204 ((zword) (parse + 0), addr);
A00203 ((zword) (parse + 2), length);
A00203 ((zword) (parse + 3), from);
}
}
}/* tokenise_text */
/*
* A00258
*
* Split an input line into words and translate the words to tokens.
*
*/
void A00258 (zword text, zword token, zword dct, bool flag)
{
zword addr1;
zword addr2;
zbyte length;
zbyte c;
length = 0; /* makes compilers shut up */
/* Use standard dictionary if the given dictionary is zero */
if (dct == 0)
dct = A00040;
/* Remove all tokens before inserting new ones */
A00203 ((zword) (token + 1), 0);
/* Move the first pointer across the text buffer searching for the
beginning of a word. If this succeeds, store the position in a
second pointer. Move the first pointer searching for the end of
the word. When it is found, "tokenise" the word. Continue until
the end of the buffer is reached. */
addr1 = text;
addr2 = 0;
if (A00035 >= V5) {
addr1++;
LOW_BYTE (addr1, length)
}
do {
zword sep_addr;
zbyte sep_count;
zbyte separator;
/* Fetch next ZSCII character */
addr1++;
if (A00035 >= V5 && addr1 == text + 2 + length)
c = 0;
else
LOW_BYTE (addr1, c)
/* Check for separator */
sep_addr = dct;
LOW_BYTE (sep_addr, sep_count)
sep_addr++;
do {
LOW_BYTE (sep_addr, separator)
sep_addr++;
} while (c != separator && --sep_count != 0);
/* This could be the start or the end of a word */
if (sep_count == 0 && c != ' ' && c != 0) {
if (addr2 == 0)
addr2 = addr1;
} else if (addr2 != 0) {
tokenise_text (
text,
(zword) (addr1 - addr2),
(zword) (addr2 - text),
token, dct, flag );
addr2 = 0;
}
/* Translate separator (which is a word in its own right) */
if (sep_count != 0)
tokenise_text (
text,
(zword) (1),
(zword) (addr1 - text),
token, dct, flag );
} while (c != 0);
}/* A00258 */
/*
* A00183, make a lexical analysis of a ZSCII string.
*
* zargs[0] = address of string to analyze