[
Lists Home |
Date Index |
Thread Index
]
- From: "Eisele, Fred" <fred.eisele@eds.com>
- To: "XML Dev (E-mail)" <xml-dev@ic.ac.uk>
- Date: Tue, 23 Feb 1999 11:17:50 -0500
This is off the top of my head but...
Presume that the XML engine has the job of determining whether
a particular stream is a theorem of a particular language.
Ultimately, the stream is either a well-formed-formula (wff) or it
is not, and if it is a wff it may also be a theorem, i.e. valid.
There is another category before the wff (the name escapes me).
In the context of NFA (regular expressions (which I realize XML is
not)) the automata goes through many states, some of which indicate
that the formula is not well-formed, but until that time the formula
is tentatively accepted.
It seems to me that this is the status of a stock ticker until the
final end tag is set.
In addition to this is the general situation
that wff's are built up from other wff's.
This is what seems to be going on with the Streaming XML.
That's all.
Thanks
xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:majordomo@ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo@ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@ic.ac.uk)
|
