Re: Measuring the complexity of XSLT stylesheets
* Sebastien Arbogast | | Maybe you could try to bring the problem back to a question of | algorithm complexity. Well, algorithm complexity is a measure of how quickly the time increases with the size of the input. That's not my concern, however. I'm interested in the complexity of the stylesheet as perceived by a human being. So a better measure for my purposes would be something like McCabe cyclomatic complexity, but I'm clueless about how to compute that for an XSLT stylesheet. | Because a XSLT stylesheet doesn't have any complexity in itself : | it's not code in itself because it's not compiled or | interpreted. I'd say an XSLT stylesheet *is* code, because it is an executable description of a process. It's pretty declarative, but still code, IMHO. | The real program, where complexity really is (in terms of code | performance if that's what you mean), it's the XSLT processor. So | the first thing you have to do to evaluate complexity is to choose | one implementation of an XSLT processor (MSXML, Saxon, Xalan, | etc.). If my goal was to find out how long it would take to run the stylesheet this would be of interest, but I'm more concerned with how difficult the stylesheet is to write and maintain. So I'm looking for complexity in a different sense. -- Lars Marius Garshol, Ontopian <URL: http://www.ontopia.net > GSM: +47 98 21 55 50 <URL: http://www.garshol.priv.no >
PURCHASE STYLUS STUDIO ONLINE TODAY!
Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!
Download The World's Best XML IDE!
Accelerate XML development with our award-winning XML IDE - Download a free trial today!
Subscribe in XML format