Le mardi 27 septembre 2005 à 19:12 +1000, Dimitre Novatchev a écrit :
Of course, a function, which takes a list of grammar rules and returns
another function, which is a parser for this grammar -- such parser
generator *is* of very high importance.
People have done this in Haskell --
Although he hasn't followed this principle, James Clark has published
his implementation notes for the derivation method as Haskell snippets:
http://www.thaiopensource.com/relaxng/implement.html
That's a must read for anyone considering writing an implementation of
RELAX NG!
I ***think*** that you could follow these notes in XSLT 1.0 assuming you
have a node-set extension and the few stuff I have seen of FXSL makes me
think that it could help in this task.
Eric (wishing he'd have enough time to give it a try)
PS: If that may be of interest, I have published a set of
transformations that transform a RELAX NG schema into its simple form:
http://downloads.xmlschemata.org/relax-ng/utilities/ (these are the
transformations I have used to illustrate the section about
simplification in my RELAX NG book:
http://books.xmlschemata.org/relaxng/relax-CHP-15-SECT-1.html )
--
Carnet web :
http://eric.van-der-vlist.com/blog?t=category&a=Fran%C3%A7ais
------------------------------------------------------------------------
Eric van der Vlist http://xmlfr.org http://dyomedea.com
(ISO) RELAX NG ISBN:0-596-00421-4 http://oreilly.com/catalog/relax
(W3C) XML Schema ISBN:0-596-00252-1 http://oreilly.com/catalog/xmlschema
------------------------------------------------------------------------
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--