W3C home > Mailing lists > Public > xmlschema-dev@w3.org > January 2002

Re: Substitution groups and Parsing Efficiency

From: Henry S. Thompson <ht@cogsci.ed.ac.uk>
Date: 08 Jan 2002 15:58:25 +0000
To: Mark Feblowitz <mfeblowitz@frictionless.com>
Cc: "Xmlschema-Dev (E-mail)" <xmlschema-dev@w3.org>
Message-ID: <f5bk7useswu.fsf@cogsci.ed.ac.uk>
Mark Feblowitz <mfeblowitz@frictionless.com> writes:

> That answers the execution performance question. Do these constructs also
> have efficient internal representations in terms of their memory
> consumption? Is the code for processing a substitution group compact? Is it
> factored or replicated?

In XSV, nothing of the sort :-).  XSV is designed as a vehicle for
exploring W3C XML Schema semantics, and efficiency of any kind is a
2nd-order consideration.

Speaking of which, note that if you use any numeric exponents other
than min=0/1, you get a _very_ large fsm, and in fact XSV arbitrarily
treats any max over 101 as unbounded, and any min over 101 as 101.
This isn't even the right optimisation. . .

ht
-- 
  Henry S. Thompson, HCRC Language Technology Group, University of Edinburgh
          W3C Fellow 1999--2001, part-time member of W3C Team
     2 Buccleuch Place, Edinburgh EH8 9LW, SCOTLAND -- (44) 131 650-4440
	    Fax: (44) 131 650-4587, e-mail: ht@cogsci.ed.ac.uk
		     URL: http://www.ltg.ed.ac.uk/~ht/
Received on Tuesday, 8 January 2002 10:58:28 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 11 January 2011 00:14:26 GMT