in reply to Re: A Regexp Assembler/Compiler in thread A Regexp Assembler/Compiler
I don't think that there is anything wrong in posing this question in the language of boolean logic and set theory. Any solution set of the above subroutine will be the union of the complement of the solution set of the first regexp and the solution sets of the other regexps. Although finding a regexp whose solution set this is would be non-trivial, as Abigail-II points out.
Re(3): A Regexp Assembler/Compiler
by gumby (Scribe) on Jun 19, 2002 at 15:56 UTC
|
On further reflection, it's actually quite likely that algorithms have been developed for similar problems (ie. Boolean algebra's, elimination theory etc.). | [reply] [Watch: Dir/Any] |
|