Re: Fast NFA engine anyone?

"Remo D." <rd3ntat0@hotmail.com>
12 May 2006 00:49:39 -0400

          From comp.compilers

Related articles
Fast NFA engine anyone? rd3ntat0@hotmail.com (Remo D.) (2006-04-21)
Re: Fast NFA engine anyone? rsc@swtch.com (Russ Cox) (2006-04-22)
Re: Fast NFA engine anyone? rd3ntat0@hotmail.com (Remo D.) (2006-04-22)
Re: Fast NFA engine anyone? cfc@shell01.TheWorld.com (Chris F Clark) (2006-04-23)
Re: Fast NFA engine anyone? reeuwijk@few.vu.nl (2006-04-23)
Re: Fast NFA engine anyone? Danny.Dube@ift.ulaval.ca (2006-05-11)
Re: Fast NFA engine anyone? rd3ntat0@hotmail.com (Remo D.) (2006-05-12)
| List of all articles for this month |

From: "Remo D." <rd3ntat0@hotmail.com>
Newsgroups: comp.compilers
Date: 12 May 2006 00:49:39 -0400
Organization: MC-link SpA InterNetNews site
References: 06-04-121 06-04-129 06-05-034
Keywords: lex

Danny Dubé wrote:
> "Remo D." <rd3ntat0@hotmail.com> writes:
>> [...]
>> Well, consider that I'm interested in subpatterns and back references as
>> well (sorry, I didn't mentioned that in my post).
>>
>
> Maybe the technique described in:
>
> Dubé D., Feeley M. (2000), "Efficiently building a parse tree from
> a regular expression", Acta Informatica, volume 37, no. 2, pages
> 121-144.
>
> will interest you. However, it takes care of subpatterns only, not of
> back references.


Thanks! I'll certainly have a look at it, I hope it's available in
electronic form on the Net.


I'm almost convinced I should care for subpatterns only and dismiss back
references. I think I now understand the impact of introducing them in a
pattern matching system.


Thanks again.
Remo D.


Post a followup to this message

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