Re: StringBuilder Extension: IsQuotedBy

> Any single given regex terminates in a single state, "matched". A
> tokenizer has multiple ending states, one for each token. This is the
> key difference between most third-party regex libraries and the
> requirements of people writing parsers for well-defined languages.
>
> -- Barry

I would expect a regex implementation to construct a FSM from it's
expression string. Meaning that a "single given regex" could terminate in
multiple states, each of which is a "matched" state. If it keeps hitting a
matched state until the input buffer is finished, then, the string
'qualifies'. That, in my mind, is the difference between  a state engine and
a collation engine like strcomp (never mind that you can illustrate FSM
graphically by pointing to a final dot on paper). But I expect a Regex
implementation to create a unique FSM from every input signature.

===================================
This list is hosted by DevelopMentor®  http://www.develop.com

View archives and manage your subscription(s) at http://discuss.develop.com