Re: Limits of regular languages

Matthias-Christian Ott <ott@mirix.org>
Sat, 13 Feb 2010 17:52:57 +0100

          From comp.compilers
Related articles
Limits of regular languages e0726905@student.tuwien.ac.at (e0726905) (2010-02-11)
Re: Limits of regular languages ott@mirix.org (Matthias-Christian Ott) (2010-02-13)
Re: Limits of regular languages kkylheku@gmail.com (Kaz Kylheku) (2010-02-13)
Re: Limits of regular languages cfc@shell01.TheWorld.com (Chris F Clark) (2010-02-13)
Re: Limits of regular languages max@gustavus.edu (Max Hailperin) (2010-02-13)
Re: Limits of regular languages e0726905@student.tuwien.ac.at (e0726905) (2010-02-27)
| List of all articles for this month |
From: Matthias-Christian Ott <ott@mirix.org>
Newsgroups: comp.compilers
Date: Sat, 13 Feb 2010 17:52:57 +0100
Organization: Compilers Central
References: 10-02-052
Keywords: lex, DFA
Posted-Date: 13 Feb 2010 12:01:32 EST

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


Post a followup to this message

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