Re: regular expressions (bug-report)

mab@wdl39.wdl.loral.com (Mark A Biggar) writes:
|> 2) DFA based pattern matches don't handle [A-Z] well (a major resaon why
|> they get so big).


I wonder about this.


My regular expression class uses lazy evaluation of a DFA, and has no
problems with the above. In fact, a character class (represented as a set
of characters, implemented as a bit vector) is the *only* type a leaf node
can have in the parse of the regular expression. Single characters (and
the special character '.') are only special cases of a character class.
--
James Kanze email: kanze@us-es.sel.de
GABI Software, Sarl., 8 rue du Faisan, F-67000 Strasbourg, France
--

Return to the comp.compilers page.
Search the comp.compilers archives again.