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

Re: Push / pull model

• To: tbray@t... (Tim Bray)
• Subject: Re: Push / pull model
• From: John Cowan <jcowan@r...>
• Date: Thu, 19 Sep 2002 12:47:18 -0400 (EDT)
• Cc: jcowan@r... (John Cowan), keith@w..., larsga@g... (Lars Marius Garshol), xml-dev@l...
• In-reply-to: <3D89FD28.9080604@t...> from "Tim Bray" at Sep 19, 2002 09:36:56 AM

Tim Bray scripsit:

> Hee-hee, on the other hand, most of the popular XML processors are built 
> around recursive-descent algorithms.  -Tim

Sure, grab the good pattern for yourselves, and leave the poor user in the muck.

-- 
John Cowan  jcowan@r...  www.reutershealth.com  www.ccil.org/~cowan
Promises become binding when there is a meeting of the minds and consideration
is exchanged. So it was at King's Bench in common law England; so it was
under the common law in the American colonies; so it was through more than
two centuries of jurisprudence in this country; and so it is today. 
       --_Specht v. Netscape_

• References:
  • Re: Push / pull model
    • From: Tim Bray <tbray@t...>

• Prev by Date: RE: Push / pull model
• Next by Date: Re: Push / pull model
• Previous by thread: Re: Push / pull model
• Next by thread: RE: Push / pull model
• Index(es):
  • Date
  • Thread