- From: Aaron Swartz <aswartz@upclink.com>
- Date: Wed, 30 May 2001 15:28:49 -0500
- To: Jan Grant <Jan.Grant@bristol.ac.uk>
- CC: Dan Connolly <connolly@w3.org>, RDFCore Working Group <w3c-rdfcore-wg@w3.org>
Jan Grant <Jan.Grant@bristol.ac.uk> wrote: >>> I think you're not taking into account cases like... >>> >>> <#DanC> <#hasCousin> >>> [ <#hairColor> <#brown> ]. >> >> Hmm, good point. OK, how about: >> >> [ <#hairColor> <#brown> ; is <#hasCousin> of <#DanC> ] . > > What I'm after is a format for producing output from parsers (for > instance) that _doesn't_ require complicated handling; I don't want to > have to debug my test-output generator or reader too! Perhaps we should not take this all on at once, but I'm hoping that the format we choose is usable with standard tools (diff/sort) and provides a canonical version useful for other things (digital signing, transport, etc.). Personally, I'm not much in the mood for coding and debugging a graph matching tool. However, I can write a script to output the format I suggest in only a couple of lines and code already exists to read it (the various N3 parsers). -- Aaron Swartz <me@aaronsw.com>| RSS Info <http://www.aaronsw.com> | <http://www.blogspace.com/rss/> AIM: JediOfPi | ICQ: 33158237| news and information on the RSS format
Received on Wednesday, 30 May 2001 16:29:03 UTC