The Dictionary seems plain to me, & I agree with Raul. Are we differing over the meaning of a convoluted English sentence?
> Parsing proceeds by moving successive elements (or their values > except in the case of proverbs and names immediately to the left of > a copula) from the tail end of a queue (initially the original > sentence prefixed by a marker §) to the top of a stack (initially > four markers), and eventually executing some eligible portion of > the stack and replacing it by the result of the execution. I this it is equivalent to the following: Parsing proceeds by removing an element from the tail end of a queue, and pushing a corresponding token onto a stack. The token that is pushed is created as follows: if the element taken from the queue is a proverb (i. e. the name of a verb) or a name immediately to the left of a copula, the token is the name itself (i. e., the same as the element); in all other cases, the token is the value represented by the element (if the element is a name, the name is evaluated and the value has the part of speech appropriate for that value; if the element is a constant, the value of the constant is used as a noun). The stack initially holds four markers. After a token is pushed onto the stack, the top of the stack is checked to see if it matches a line in the parsing table; if it does, the indicated portion of the stack is executed and replaced by the result of the execution, and the modified stack is again checked to see if it matches the parsing table. When the stack does not match any line of the parsing table, the procedure is repeated, removing the next element from the queue and pushing a token onto the stack. When there are no more elements in the queue, execution terminates and the result of the sentence is the single token on the stack. If there is more than one token on the stack, the sentence has a syntax error. Henry Rich Dan Bron wrote: > I believe this response begs (or denies) the question. I will try to post a > fuller explanation later. > > -Dan > > Excuse typos; this message was composed on a phone. > > -----Original Message----- > From: Raul Miller <[email protected]> > > Date: Fri, 14 Aug 2009 17:42:12 > To: Programming forum<[email protected]> > Subject: Re: [Jprogramming] Stacking by name > > > On Fri, Aug 14, 2009 at 5:10 PM, Dan Bron<[email protected]> wrote: >> Does the Dictionary predict this behavior (not resolving names >> until they're executed), and if so, where? > > http://www.jsoftware.com/help/dictionary/dicte.htm > > Parsing proceeds by moving successive elements (or their values > except in the case of proverbs and names immediately to the left of > a copula) from the tail end of a queue (initially the original > sentence prefixed by a marker §) to the top of a stack (initially > four markers), and eventually executing some eligible portion of > the stack and replacing it by the result of the execution. > > Also note that the dictionary identifies two kinds of names: > pronouns and proverbs. Apparently, the term "proverb" > also includes named adverbs and conjunctions. > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
