
DIRECTORY
PFS USING [PathFromRope, StreamOpen],
IO,
Random USING [Create, ChooseInt, RandomStream],
BitTableLookup USING [Read, Lookup, Table],
RefText USING [TrustTextAsRope],
SpellingToolServices USING [BruteForceCorrection],
Rope USING [ROPE];

SpellingTestImpl: CEDAR PROGRAM
IMPORTS PFS, IO, BitTableLookup, Random, RefText, SpellingToolServices = BEGIN
ROPE: TYPE = Rope.ROPE;

experimental: ROPE м "Experimental.BitTable";
web2: ROPE м "Web2.dic";

Garbage: PROC [minLength, maxLength: CARDINAL, number: INT, file: ROPE]
RETURNS [passed, failed: INT м 0] = {
s: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[experimental]];
trouble: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[file], create];
globalBitTable: BitTableLookup.Table м NIL;
length: INT;
randomSequence: Random.RandomStream м Random.Create[-1, 0];
word: REF TEXT м NEW[TEXT[maxLength]];
globalBitTable м BitTableLookup.Read[s];
s.Close[];
FOR i: INT IN [0..number) DO
length м Random.ChooseInt[randomSequence, minLength, maxLength];
word.length м length;
FOR j: INT IN [0..length) DO
word[j] м 'a + Random.ChooseInt[randomSequence, 0, 25];
ENDLOOP;
IF globalBitTable.Lookup[word] THEN {
trouble.Put1[IO.text[word]];
trouble.PutChar['\n];
passed м passed + 1;
}
ELSE 
failed м failed + 1;
ENDLOOP;
trouble.Close[];
};

Garbage4: PROC [file: ROPE] RETURNS [passed, failed: INT м 0] = {
s: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[experimental]];
trouble: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[file], create];
globalBitTable:  BitTableLookup.Table м NIL;
word: REF TEXT м NEW[TEXT[4]];
globalBitTable м BitTableLookup.Read[s];
s.Close[];
word.length м 4;
FOR c0: CHAR IN ['a..'z] DO
FOR c1: CHAR IN ['a..'z] DO
FOR c2: CHAR IN ['a..'z] DO
FOR c3: CHAR IN ['a..'z] DO
word[0] м c0; 
word[1] м c1;
word[2] м c2;
word[3] м c3;
IF globalBitTable.Lookup[word] THEN {
trouble.PutText[word];
trouble.PutChar['\n];
passed м passed + 1;
}
ELSE 
failed м failed + 1;
ENDLOOP;
ENDLOOP;
ENDLOOP;
ENDLOOP;
trouble.Close[];
};

Garbage3: PROC [file: ROPE] RETURNS [passed, failed: INT м 0] = {
s: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[experimental]];
trouble: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[file], create];
globalBitTable:  BitTableLookup.Table м NIL;
word: REF TEXT м NEW[TEXT[3]];
globalBitTable м BitTableLookup.Read[s];
s.Close[];
word.length м 3;
FOR c0: CHAR IN ['a..'z] DO
FOR c1: CHAR IN ['a..'z] DO
FOR c2: CHAR IN ['a..'z] DO
word[0] м c0; 
word[1] м c1;
word[2] м c2;
IF globalBitTable.Lookup[word] THEN {
trouble.PutText[word];
trouble.PutChar['\n];
passed м passed + 1;
}
ELSE 
failed м failed + 1;
ENDLOOP;
ENDLOOP;
ENDLOOP;
trouble.Close[];
};

Garbage2: PROC [file: ROPE] RETURNS [passed, failed: INT м 0] = {
s: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[experimental]];
trouble: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[file], create];
globalBitTable:  BitTableLookup.Table м NIL;
word: REF TEXT м NEW[TEXT[2]];
globalBitTable м BitTableLookup.Read[s];
s.Close[];
word.length м 2;
FOR c0: CHAR IN ['a..'z] DO
FOR c1: CHAR IN ['a..'z] DO
word[0] м c0; 
word[1] м c1;
IF globalBitTable.Lookup[word] THEN {
trouble.PutText[word];
trouble.PutChar['\n];
passed м passed + 1;
}
ELSE 
failed м failed + 1;
ENDLOOP;
ENDLOOP;
trouble.Close[];
};

Garbage1: PROC [file: ROPE] RETURNS [passed, failed: INT м 0] = {
s: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[experimental]];
trouble: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[file], create];
globalBitTable: BitTableLookup.Table м NIL;
word: REF TEXT м NEW[TEXT[2]];
globalBitTable м BitTableLookup.Read[s];
s.Close[];
word.length м 2;
FOR c0: CHAR IN ['a..'z] DO
word[0] м c0; 
IF globalBitTable.Lookup[word] THEN {
trouble.PutText[word];
trouble.PutChar['\n];
passed м passed + 1;
}
ELSE 
failed м failed + 1;
ENDLOOP;
trouble.Close[];
};

CloseOnes: PROC [outFile: ROPE м "Spelling.CloseOnes"]
RETURNS [passed, failed: INT м 0] = {
bitStream: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[experimental]];
listStream: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[web2]];
outStream: IO.STREAM м PFS.StreamOpen[PFS.PathFromRope[outFile], create];
buffer: REF TEXT м NEW[TEXT[100]];
wordBuffer: REF TEXT м NEW[TEXT[100]];
correctionList: LIST OF ROPE м NIL;
globalBitTable: BitTableLookup.Table м BitTableLookup.Read[bitStream];
WordChecker: PROC [w: REF TEXT] RETURNS [inTable: BOOL] = {
inTable м globalBitTable.Lookup[w];
};
bitStream.Close[];
DO 
wordBuffer м GetToken[listStream, wordBuffer ! IO.EndOfStream => EXIT];
[correctionList, buffer] м SpellingToolServices.BruteForceCorrection [RefText.TrustTextAsRope[wordBuffer], WordChecker, buffer];
FOR l: LIST OF ROPE м correctionList, l.rest UNTIL l = NIL DO
outStream.PutRope[l.first];
outStream.PutChar['\n];
ENDLOOP;
ENDLOOP;
outStream.Close[];
listStream.Close[];
};


GetToken: PROC [s: IO.STREAM, word: REF TEXT] RETURNS [w: REF TEXT] = {
UnPrintable: PROC [c: CHAR] RETURNS [unPrintable: BOOL] = INLINE {
unPrintable м c IN ['\000 .. '\040];
};
c: CHAR;
w м word;
WHILE UnPrintable[c м s.GetChar[]] DO ENDLOOP; 
s.Backup[c];
w.length м w.maxLength;
FOR i: CARDINAL м 0, i+1 DO
c м s.GetChar[ ! IO.EndOfStream => GOTO done];
IF UnPrintable[c] THEN GOTO done;
IF i >= w.maxLength THEN {
w м NEW[TEXT[2*w.maxLength+1]];
w.length м w.maxLength;
};
w[i] м c;
REPEAT
done => w.length м i;
ENDLOOP;
};

END.
  (  
SpellingTestImpl.mesa
Copyright ╙ 1983, 1987, 1990, 1992 by Xerox Corporation.  All rights reserved.
Created by Nix on September 8, 1983 11:17 am
Last Edited by: Nix, November 17, 1983 1:36 pm
Jack Kent July 24, 1987 1:26:36 pm PDT
Tim Diebert: January 26, 1987 5:06:53 pm PST
Rick Beach, May 2, 1985 3:21:23 pm PDT
Bill Jackson (bj), March 7, 1990 9:50 pm PST
Doug Terry, March 4, 1991 12:45 pm PST
Willie-s, May 22, 1992 2:28 pm PDT
Utility for reading a token from the given stream into the given buffer.
How's this for device independence?

Э╩X  Ц(cedarcode) styleХNewlineDelimiter
Щ codeЦ"Cedar" styleЪЬЩKЦ"Cedar" styleЪЬ
╧eЬCЩNKЪЬ,Щ,KЩ.KЩ&KЩ,KЩ&KЩ,KЩ&KЩ"KШ ЧЪ╧k	Ш	KЪЮЬЮЬШ%KЪЮЬШKЪЬЮЬ#Ш/KЪЬЮЬШ+KЪЬЮЬШ KЪЬЮЬШ2KЪЬЮЬЮЬШKШ ЧЪ╧nЬЮЬЮШKЪЮЬЮЬЮЬ:ЮШNKЪЮЬЮЬЮЬШKШ KЪЬЮЬШ-KЪЬЮЬШKШ ЪЯЬЮЬЮЬ
ЮЬЮЬЮЬЮЬ	ШmKЪ	ЬЮЬЮЬЮЬЮЬШ>KЪ	Ь	ЮЬЮЬЮЬЮЬШDKЪЬ'ЮЬШ+KЪЬЮЬШKШ;KЪ	ЬЮЬЮЬЮЬЮЬШ&KШ(KШ
ЪЮЬЮЬЮЬЮШKШ@KШЪЮЬЮЬЮЬЮШKШ7KЪЮЬШЧЪЮЬЮЬШ%KЪЬЮЬШKШKШKШЧЪЮЬШKШЧKЪЮЬШЧKШKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬ	ШAKЪ	ЬЮЬЮЬЮЬЮЬШ>KЪ	Ь	ЮЬЮЬЮЬЮЬШDKЪЬ(ЮЬШ,KЪ	ЬЮЬЮЬЮЬЮЬШKШ(KШ
KШЪЮЬЮЬЮЬ
ЮШЪЮЬЮЬЮЬ
ЮШЪЮЬЮЬЮЬ
ЮШЪЮЬЮЬЮЬ
ЮШKШKШKШKШЪЮЬЮЬШ%KШKШKШKШЧЪЮЬШKШЧKЪЮЬШЧKЪЮЬШЧKЪЮЬШЧKЪЮЬШЧKШKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬ	ШAKЪ	ЬЮЬЮЬЮЬЮЬШ>KЪ	Ь	ЮЬЮЬЮЬЮЬШDKЪЬ(ЮЬШ,KЪ	ЬЮЬЮЬЮЬЮЬШKШ(KШ
KШЪЮЬЮЬЮЬ
ЮШЪЮЬЮЬЮЬ
ЮШЪЮЬЮЬЮЬ
ЮШKШKШKШЪЮЬЮЬШ%KШKШKШKШЧЪЮЬШKШЧKЪЮЬШЧKЪЮЬШЧKЪЮЬШЧKШKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬ	ШAKЪ	ЬЮЬЮЬЮЬЮЬШ>KЪ	Ь	ЮЬЮЬЮЬЮЬШDKЪЬ(ЮЬШ,KЪ	ЬЮЬЮЬЮЬЮЬШKШ(KШ
KШЪЮЬЮЬЮЬ
ЮШЪЮЬЮЬЮЬ
ЮШKШKШЪЮЬЮЬШ%KШKШKШKШЧЪЮЬШKШЧKЪЮЬШЧKЪЮЬШЧKШKШKШ ЧЪ
ЯЬЮЬЮЬЮЬЮЬ	ШAKЪ	ЬЮЬЮЬЮЬЮЬШ>KЪ	Ь	ЮЬЮЬЮЬЮЬШDKЪЬ'ЮЬШ+KЪ	ЬЮЬЮЬЮЬЮЬШKШ(KШ
KШЪЮЬЮЬЮЬ
ЮШKШЪЮЬЮЬШ%KШKШKШKШЧЪЮЬШKШЧKЪЮЬШЧKШKШKШ ЧЪ
Я	ЬЮЬЮЬЮЬЮЬ	Ш\KЪ	ЬЮЬЮЬЮЬЮЬШFKЪ	ЬЮЬЮЬЮЬЮЬШ?KЪ	ЬЮЬЮЬЮЬЮЬ ШIKЪ	ЬЮЬЮЬЮЬЮЬШ"KЪ	ЬЮЬЮЬЮЬЮЬШ&KЪ	ЬЮЬЮЬЮЬЮЬШ#KШFЪЯЬЮЬЮЬЮЬЮЬЮЬШ;KШ#KШЧKЪЬШЪЮЬШKЪЬ/ЮЬЮЬШGKШАЪЮЬЮЬЮЬЮЬЮЬЮЬЮШ=KШKШKЪЮЬШЧKЪЮЬШЧKШKЪЬШЪЬШKШ ЧKШ ЧЪЯЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬЮЬШGKЪЬHЩHЪЯЬЮЬЮЬЮЬЮЬЮЬШBKЪЬ#Щ#KЪЬЮЬШ$KШЧKЪЬЮЬШKШ	KЪЮЬЮЬЮЬШ/KШKШЪЮЬЮЬ
ЮШKЪЬЮЬЮЬШ.KЪЮЬЮЬЮЬШ!ЪЮЬЮЬШKЪЬЮЬЮЬШKШKШЧKШ	ЪЮШKШЧKЪЮЬШЧKШЧKШ KЪЮЬШKЩ ЧЧ ЕЧ    ╕  8  