W
Walter Roberson
I remember reading on this newsgroup, maybe about a year ago, of
a module that did a Finite State Machine implementation of "standard"
regular expressions -- i.e., just what can be built out of
concatenation, alternation, and repetition, (and perhaps
some syntactic sugar such as charactre-classes), without the perl
extensions that lift perl's regex's into a different parser class
entirely.
Unfortunately, when I tried to find the posting again, I could
not, and I could not find anything like that in CPAN.
The matter came to my mind again today when someone mentioned
the Yapp module and parsing speeds -- one of the points that
can really slow down perl's regexes is the backtracking that it
does. If one happens to be working with input whose grammar is
not overly complex, then one might be perfectly happy with
faster but less flexible RE's and a perl equivilent of
yacc and lex.
Would anyone happen to recall the name and location of that
finite-state RE module? Something like that could potentially speed
up a number of my programs.
a module that did a Finite State Machine implementation of "standard"
regular expressions -- i.e., just what can be built out of
concatenation, alternation, and repetition, (and perhaps
some syntactic sugar such as charactre-classes), without the perl
extensions that lift perl's regex's into a different parser class
entirely.
Unfortunately, when I tried to find the posting again, I could
not, and I could not find anything like that in CPAN.
The matter came to my mind again today when someone mentioned
the Yapp module and parsing speeds -- one of the points that
can really slow down perl's regexes is the backtracking that it
does. If one happens to be working with input whose grammar is
not overly complex, then one might be perfectly happy with
faster but less flexible RE's and a perl equivilent of
yacc and lex.
Would anyone happen to recall the name and location of that
finite-state RE module? Something like that could potentially speed
up a number of my programs.