[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: If SAX == lex, then what == yacc?

• From: Sean Chen <schen@f...>
• To: "Anthony B. Coates" <abcoates@T...>
• Date: Tue, 23 Nov 1999 11:38:17 -0500 (EST)

Hi Anthony, everyone,

On Wed, 24 Nov 1999, Anthony B. Coates wrote:

> ** Reply to message from "James Tauber" <jtauber@j...> on Mon, 22 Nov
> 1999 09:20:43 -0500
> 
> 	What you describe (included below) strikes me as using SAX
> events to build a not-quite-DOM tree, which is exactly what I would
> expect FOP to do.  However, I can envisage applications, operating on
> either large or streaming XML files, where building a tree is not an
> appropriate solution.  Compilers (traditionally)  don't build a tree
> version of a source file before they start outputting the object code to
> a file. 

Er... minor correction here.  Compilers *do* traditionally build a tree
version of a source file, it's called the AST, Abstract Syntax Tree. 

Back on topic, what you're looking for might be done by MDSAX, or Coins
(whatever it is called nowadays). 

. . . Sean.



xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev@i...
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To unsubscribe, mailto:majordomo@i... the following message;
unsubscribe xml-dev
To subscribe to the digests, mailto:majordomo@i... the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa@i...)

• Follow-Ups:
  • Re: If SAX == lex, then what == yacc?
    • From: Steinar Bang <sb@m...>

• References:
  • Re: If SAX == lex, then what == yacc?
    • From: "Anthony B. Coates" <abcoates@T...>

• Prev by Date: Re: If SAX == lex, then what == yacc?
• Next by Date: RE: SGML, XML and SML
• Previous by thread: Re: If SAX == lex, then what == yacc?
• Next by thread: Re: If SAX == lex, then what == yacc?
• Index(es):
  • Date
  • Thread