peters@yang.earlham.edu (12/14/90)
Has anyone written Pascal routines for boolean searches of text files?
They should parse search requests like the following
(str1 and str2) or (str3 and str4)
(str1 and str2 and str3 and str4)
(str1 and not str2)
and then conduct the appropriate searches.
I've begun, and realize that the job is much larger, but also much
more interesting, than at first appears. Unfortunately, I don't have
time to finish. To use Borland's metaphor in the TP6 manuals, I'd rather
"inherit the wheel" than invent it.
Second best: a pointer to a commercial source for such routines.
There are many variations: case sensitive/insensitive search
switches; search file lines or records; search a single file or a set
determined by a dir mask; use of wildcards; and so on. If I receive
a range of replies, I'll consolidate them somehow and re-post them
for others.
Thanks in advance.
Peter Suber. Depts. of Philosophy, Computer Science. Earlham College.
Richmond, Indiana 47374. 317-983-1214. peters@earlham.bitnet.