Hi all, I am trying to choose a specific array language to learn and have narrowed my list down to two - J and Q/kbd. Is there any general accepted wisdoms known by you experienced in either as to the pro's / cons of each.
My thoughts so far are: 1) It is for personal/learning use - so i am not bothered by the high cost of K as they have a free version for personal use. 2) My first project is parsing a csv generated from excel and distilling it - I find that the Q syntax of select/where clauses are easier, and the equivalent in J is not so obvious. I know of JDB but I do not need permanent storage and I am not finding it easy to learn how to use it. Is it easy to perform the equivalent of select/where in J tables without ahving to use JDB? 3) Q say they are fast - is J a lot slower? 4) I really like the thought of J for its tacit programming, and I also would like to experiment with combinator logic as described in the book 'to mock a mockingbird'. (it looks like form/hooks may be linked to the S/K functions in Churchs combinatory logic). Does Q have tacit programming? I have read the archive to glean what I can but kdb questions seem to be a lot more specific than mine. Thanks in advance for any of your thoughts on this. best regards Colin ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
