[
Lists Home |
Date Index |
Thread Index
]
> > Shouldn't it be possible to validate the syntax of an XPath string using
> > regular expressions.
>
> No. You at least need to be able to match () pairs, this requires
> counting, so can't be done with a regular expression.
I"m afraid I simply don't understand. :-( Are you sure about this? Is
there perhaps a qualitative difference between "counting" and (recursively)
detecting balancing delimiters?
Since reading the above I have been unsuccessfully trying to trip my XPath
parser up, by feeding it expressions containing unbalanced parens and/or
square brackets. Could you perhaps provide some examples that you would
expect to cause problems.
Hmmm..., BNF grammars are used ubiquitously to generate parsers which are in
turn quite capable of detecting unbalanced delimiters in their input. So,
if what you say is correct, then BNF grammars must be inherently more
powerful than regular expressions - yes? But aren't they both simply forms
of regular grammars cum finite automata?
<only-ever-opening-my-mouth-to-change-feet>'ly yrs,
gary
|
