Related articles |
---|
RegEx: AND operator nikt@wp.pl (jan) (2003-10-12) |
Re: RegEx: AND operator vannoord@let.rug.nl (2003-10-13) |
Re: RegEx: AND operator ahelin@student.oulu.fi (2003-10-13) |
Re: RegEx: AND operator henry@spsystems.net (2003-10-14) |
Re: RegEx: AND operator clint@0lsen.net (Clint Olsen) (2003-10-14) |
Re: RegEx: AND operator nikt@wp.pl (jan) (2003-10-18) |
Re: RegEx: AND operator nikt@wp.pl (jan) (2003-10-19) |
RE: RegEx: AND operator qjackson@shaw.ca (Quinn Tyler Jackson) (2003-10-27) |
From: | "jan" <nikt@wp.pl> |
Newsgroups: | comp.compilers |
Date: | 19 Oct 2003 16:01:10 -0400 |
Organization: | http://news.icm.edu.pl/ |
References: | 03-10-045 03-10-077 |
Keywords: | lex |
Posted-Date: | 19 Oct 2003 16:01:09 EDT |
Użytkownik "Henry Spencer" <henry@spsystems.net> napisał
> If you are willing to use NFA->DFA conversions, you can preprocess
> it out, exploiting the identity x&y == ~(~x | ~y) and the
> straightforward DFA implementation of the NOT operator.
Duh, obvious transformation which I'll probably use. I am still
curious to see how to intersect states, though. Does anyone know good
reference for this and actually other details about converting regex
-> NFA and/or DFA, and backwards, other than GREP, Mark William
Hopkins' articles, and Aho+Ullman books?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.