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" http://en.wikipedia.org/wiki/Domain_of_a_function http://en.wikipedia.org/wiki/Effective_domain Mohamed -- Innovimax SARL Consulting, Training & XML Development 9, impasse des Orteaux 75020 Paris Tel : +33 9 52 475787 Fax : +33 1 4356 1746 http://www.innovimax.fr RCS Paris 488.018.631 SARL au capital de 10.000 €
Received on Wednesday, 13 June 2012 10:12:32 UTC