I think that the issue here isn't so much good perl support for XML
as it is good support for attributed DAGs, something which would be
of general good use for perl, since the ASTs the parser feeds to the
compiler will ultimately be DAGs of a sort.
So, rather than jumping on the XML [insert
Dan Sugalski wrote:
I think that the issue here isn't so much good perl support for XML as
it is good support for attributed DAGs, something which would be of
general good use for perl, since the ASTs the parser feeds to the
compiler will ultimately be DAGs of a sort.
So, rather than jumping
On Mar 26, Robin Berjon wrote:
Dan Sugalski wrote:
I think that the issue here isn't so much good perl support for XML as
it is good support for attributed DAGs, something which would be of
general good use for perl, since the ASTs the parser feeds to the
compiler will ultimately be DAGs
At 4:47 PM +0100 3/26/03, Robin Berjon wrote:
Dan Sugalski wrote:
I think that the issue here isn't so much good perl support for XML
as it is good support for attributed DAGs, something which would be
of general good use for perl, since the ASTs the parser feeds to
the compiler will ultimately
Dan Sugalski wrote:
At 4:47 PM +0100 3/26/03, Robin Berjon wrote:
Fast and efficient graphs of all sorts would be very useful. A way to
define a complex graph of interlinked arbitrary objects while being
reasonable on memory and good with GC would be a definitive big win,
especially if it can
On Wed, Mar 26, 2003 at 05:40:56PM +0100, Robin Berjon wrote:
Dan Sugalski wrote:
At 4:47 PM +0100 3/26/03, Robin Berjon wrote:
Fast and efficient graphs of all sorts would be very useful. A way to
define a complex graph of interlinked arbitrary objects while being
reasonable on memory and
Stéphane Payrard wrote:
On Wed, Mar 26, 2003 at 05:40:56PM +0100, Robin Berjon wrote:
Efficient annotation and traversal would go a long way, but almost all
useful XML representations have loops unfortunately.
By loop you mean attributes declared by DTD as IDREFs and pointing to
element having
Kurt Starsinic wrote:
On Mar 26, Robin Berjon wrote:
DAGs wouldn't enough though, most XML tree representations aren't really
trees, they're very cyclic.
Pardon me? Could you please provide an example?
XML per se, using an impoverished Information Set (no IDs) can be considered to
be a
