[e-lang] XML library: requirements gathering

[Thomas Leonard]

On Sun, 2010-01-17 at 15:44 -0500, Kevin Reid wrote:
> On Jan 17, 2010, at 14:03, Thomas Leonard wrote:
> > 2010/1/17 Kevin Reid <kpreid at mac.com>:
> >> I'm currently implementing it by wrapping DOM trees with an immutable
> >> interface, as this seems like both the simplest path and one which
> >> minimizes the amount of (currently slow) E code executed in the high-
> >> repeat-count paths.
[...]
> > Sounds good. How do namespaces combine?
[...]
> In the long run, this should be an option; currently, it will be  
> "whatever Java does" if Java does in fact ensure namespace  
> consistency. In general, I will preserve prefixes, since XML Infoset  
> says they are significant. Note that e.g. XSLT documents make  
> references to prefixes inside of attribute values (XPath expressions)  
> which makes renaming hairy.

Good point.

> >> * It is possible to construct a customized XML quasiparser with a
> >> given set of namespace declarations.
> >>
> >> * There are means to traverse and pattern-match XML trees.  
> >> Currently I
> >> have two plans in mind for this:
> >>   1. XPath expressions can be used as subscripts. Example:
> >>     ? xml`<a>xyz</a><b>foo</b><a>bar</a>`[xpath`a/text()`]
> >>     # value: [xml`xyz`, xml`bar`]
> >>   (This is a working-right-now example.)
[...]
Can we get hold of this code from somewhere to test it?

Thanks,


-- 
Dr Thomas Leonard
IT Innovation Centre
2 Venture Road
Southampton
Hampshire SO16 7NP

Tel: +44 0 23 8076 0834
Fax: +44 0 23 8076 0833
mailto:tal at it-innovation.soton.ac.uk
http://www.it-innovation.soton.ac.uk