Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,817 of 2,753    |
|    Matthias-Christian Ott to All    |
|    Re: Limits of regular languages    |
|    13 Feb 10 17:52:57    |
      From: ott@mirix.org              On Thu, Feb 11, 2010 at 10:36:06PM +0100, e0726905 wrote:       > Hi,              Hi,              > Is there a way implement the usual longest-match behaviour of a scanner       > with a DFA without any backtracking mechanisms, meaning is that       > behaviour strictly regualr or not?              See: http://swtch.com/~rsc/regexp/              Regards,       Matthias-Chistian              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca