Converting a regular expression involving word boundaries to a DFA/NFA

chimaera@prophecy.com (Chimaera)
13 Aug 2000 19:07:52 -0400

          From comp.compilers
Related articles
Converting a regular expression involving word boundaries to a DFA/NFA chimaera@prophecy.com (2000-08-13)
| List of all articles for this month |
From: chimaera@prophecy.com (Chimaera)
Newsgroups: comp.compilers
Date: 13 Aug 2000 19:07:52 -0400
Organization: Compilers Central
Keywords: DFA, question

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.


Cheers

Post a followup to this message

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