On Dec 29, 2007 6:08 AM, neville holmes <[EMAIL PROTECTED]> wrote: > > Anyways one basic problem is that J needs to know the > > part of speech represented by [. and ]. before it > > can parse expressions containing them. ... > I'm afraid I don't see what you're getting at.
I will try again. I will show you an adverb, A, and I will show two examples of its use. Then I will show you how J parses this adverb. Then I will show you what I believe to be your proposed tacit equivalent, and I will ask you how you think J should parse that tacit expression. A=:1 :'1,2,u' 3 A 1 2 3 >: A 1 , 2 , >: require 'trace' trace '1,2,3' --------------- 2 Dyad ------- 2 , 3 2 3 --------------- 2 Dyad ------- 1 , 2 3 1 2 3 ============================== 1 2 3 trace '1,2,>:' --------------- 5 Trident ---- 2 , >: 2 , >: --------------- 5 Trident ---- 1 , 2 , >: 1 , 2 , >: ============================== So, anyways, I think you want T=: 1, 2, [. to be equivalent to A. So, when J builds the tacit expression for T, should J be using the Dyad parsing rules or the Trident parsing rules? Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
