W3C home > Mailing lists > Public > public-xml-er@w3.org > June 2012

Re: David's less simple example

From: Innovimax W3C <innovimax+w3c@gmail.com>
Date: Wed, 13 Jun 2012 12:12:02 +0200
Message-ID: <CAAK2GfEJaau=Ln+fz7GivOSm=_XPX+Pwvc6GJ9uJQvjg3TmOfQ@mail.gmail.com>
To: Robin Berjon <robin@berjon.com>
Cc: Norman Walsh <ndw@nwalsh.com>, W3C XML-ER Community Group <public-xml-er@w3.org>
On Tue, Jun 12, 2012 at 9:32 PM, Robin Berjon <robin@berjon.com> wrote:

> I do, too. One thing I've been wondering about is whether there's a name
> describing a parsing algorithm that produces useful output for every single
> input (as opposed to one that blows up for a subset of possible inputs). I
> think that it might be useful in clarifying this discussion (plus, I'm sure
> it's a cool word). Alas, my computer science proficiency is pretty much
> limited to nodding sagely whenever someone says something like "that
> halting problem has O(n) complexity in the Turing machine" so I don't know
> where to look.

It's probably more mathematical term with "Domain of a function"  and
"Effective Domain"



Innovimax SARL
Consulting, Training & XML Development
9, impasse des Orteaux
75020 Paris
Tel : +33 9 52 475787
Fax : +33 1 4356 1746
RCS Paris 488.018.631
SARL au capital de 10.000 
Received on Wednesday, 13 June 2012 10:12:32 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 19:47:26 UTC