|Converting a regular expression involving word boundaries to a DFA/NFA firstname.lastname@example.org (2000-08-13)|
|Date:||13 Aug 2000 19:07:52 -0400|
I've worked out how to modify an algorithm for converting a regular
expression to a DFA (as specified in the 'Dragon' book) to include
support for word boundaries, but my method seems a bit complicated and
beyond my knowledge to prove its correctness.
Does anybody know a better known algorithm for handling word
boundaries in regular expressions, even if it involves a conversion to
an NFA instead.
Return to the
Search the comp.compilers archives again.