Lists Home |
Date Index |
- From: David Megginson <email@example.com>
- To: Perl-XML Mailing List <firstname.lastname@example.org>, xml-dev <email@example.com>
- Date: Sat, 24 Apr 1999 06:59:28 -0400 (EDT)
Alex Milowski writes:
> Not quite. You could develop a stream-based DSSSL processor given that
> you do the appropriate analysis of the stylesheet upfront and determine
> where "caching" would have be put into place.
In DSSSL, at least, it would be probably unmanageably difficult, at
least not in the general case -- the problem is that someone could use
character data (perhaps after much arbitrary manipulation) later in
the document to decide what to select earlier, and vice-versa, using
DSSSL's navigational functions.
For example, in DSSSL, I could specify something like the following:
a. Take all of the character data of this element
b. remove all whitespace
c. reverse the order of the characters
d. remove every character where its Unicode value mod 7 is 0
e. look up the resulting string in a top-level a-list
f. process all elements in a second document that have a 'foo'
attribute whose value is lexically <= the a-list value, and
concatenate their character data
g. process the element in the first document with a 'bar' attribute
containing a number equal to the number of characters extracted
from the second document in step f.
Hopefully, things aren't quite this bad for XSL. Good luck -- I'll be
very excited if you can solve this.
All the best,
David Megginson firstname.lastname@example.org
xml-dev: A list for W3C XML Developers. To post, mailto:email@example.com
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:firstname.lastname@example.org the following message;
To subscribe to the digests, mailto:email@example.com the following message;
List coordinator, Henry Rzepa (mailto:firstname.lastname@example.org)