Path: utzoo!attcan!uunet!cs.utexas.edu!uwm.edu!rpi!brutus.cs.uiuc.edu!psuvax1!husc6!purdue!haven!udel!mmdf
From: hakimian%cs2.cs.WSU.EDU@cs2.cs.wsu.edu
Newsgroups: comp.sys.amiga
Subject: Amiga Wild Cards
Message-ID: <15041@snow-white.udel.EDU>
Date: 26 Mar 90 22:17:45 GMT
Sender: mmdf@udel.EDU
Lines: 12

>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