Re: Proposal for matching negated sets (was Re: New Public Review Issue: Proposed Update UTS #18)

From: Hans Aberg (haberg@math.su.se)
Date: Tue Oct 09 2007 - 17:13:11 CDT

  • Next message: Philippe Verdy: "RE: Proposal for matching negated sets (was Re: New Public Review Issue: Proposed Update UTS #18)"

    On 9 Oct 2007, at 23:58, Philippe Verdy wrote:

    > What's the point of DFA here (it's implementation defined, but not
    > related to the language itself)?

    That is in the reference I gave, post by by Karsten Nyblad:
    http://groups.google.com/group/comp.compilers/browse_thread/thread/
    8daad029575ed4e2/f6748b708e46af5f?lnk=st&q=&rnum=16#f6748b708e46af5f

    REs can be rewritten into DFAs, and vice versa. And taking the
    language complement of a DFA is easier than that of a RE.

       Hans Åberg

    This archive was generated by hypermail 2.1.5 : Tue Oct 09 2007 - 17:16:41 CDT