hakimian%cs2.cs.WSU.EDU@cs2.cs.wsu.edu (03/27/90)
>the Amiga "wildcards" are regular expressions.
This is not true. The Amiga "wildcards" are a superset of regular expressions.
A regular expression can be accepted by a DFA, ie you could write a lex
program to read them. Because of () in the "wildcards" Lex would choke.
When I wrote my wild card matching routines I use a DFA with special
handling of the (). So I think that the Amiga "wildcards" are closer to
a context free language then regular expressions.
Just thought I would throw in my two bits.
hakimian@cs2.cs.wsu.edu