From my point of view, the main problem would be the introduction of
unrestricted XML. Would a context-free grammar that is able to create
strings that look like XML be possible? In this way all the difficult
XML aspects (encoding issues (UCS2, UTF-8, ASCII), need to handle
arbitrary XML, unbounded number of elements, tag names not known in
advance, etc.) would be avoided, a parser could be implemented in
recursive descent, and the complexity would be down.
-------
Sender Permitted From: http://spf.pobox.com/
Archives at http://archives.listbox.com/spf-discuss/current/
Latest draft at http://spf.pobox.com/draft-mengwong-spf-02.9.4.txt
To unsubscribe, change your address, or temporarily deactivate your
subscription,
please go to
http://v2.listbox.com/member/?listname=spf-discuss(_at_)v2(_dot_)listbox(_dot_)com