Re: Hierarchical query

From: Jan Hidders <>
Date: Thu, 14 Jun 2007 10:35:28 -0700
Message-ID: <>

On 14 jun, 18:41, Vadim Tropashko <> wrote:
> On Jun 14, 2:47 am, Jan Hidders <> wrote:
> > Are you saying that anything for
> > which one would typically use XPath can be done just as well with
> > regular expressions assuming that the tree is somehow encoded in a
> > string?
> A set of strings
> > This is clearly not the case for the encoding you gave. Or are
> > you going to extend that? Perhaps also extend the regular expressions
> > a little?
> I was going to define tree query in pure language settings, be it
> regular languges, context free grammars, or else.

?? How does one query a set of strings in a "pure language setting"? Of course you might select certain strings from the set with something that accepts strings from a certain language, but that is clearly inadequate because you cannot take the "context" of the node into account. So what did you have in mind?

  • Jan Hidders
Received on Thu Jun 14 2007 - 19:35:28 CEST

Original text of this message