Re: Fast NFA engine anyone?

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.

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