I am not quite sure what you mean; but, I do not think there is any font issue on my side. For example, in the sentence '5"'EVM, '5"' is a literal and the inner " denotes the rank conjunction. That is,
a.i.'5"' 53 34 whereas for your '5” as 5’’' in 'I probably read 5” as 5’’' I get, a.i.'5” as 5’’' 53 226 128 157 32 97 115 32 53 226 128 153 226 128 153 in both my PC and iPhone and copying and pasting from my Gmail and the forum archive (using Chrome/Safari). Anyway, my point was that I cannot see how J's RL shift-reduce parser shows me that 5} is not a train but 5" is a train. I hope it helps On Fri, Dec 14, 2018 at 11:08 AM Raul Miller <[email protected]> wrote: > I think this might be at least partially a font issue. > > If I am reading your current message right, I probably read 5” as 5’’ > > And, in the environment I am currently working in (thank you Apple): > > (a) those two expressions look identical, and > > (b) I cannot experiment to determine if what’s in my message compose buffer > matches what I typed in. > > So... just in case: for the first 5” here, I used a quote character. And, > for the second, I used two apostrophes. > > :/ > > — > Raul > > On Thursday, December 13, 2018, Jose Mario Quintana < > [email protected]> wrote: > > > Thanks for the references. However, it turns out that I have been > somewhat > > familiar with an RL shift-reduce parser. > > > > Out of curiosity, I tried to shed some ligth. First with the trace > > facility, > > > > trace'5}' > > --------------- 3 Adverb ----- > > 5 > > } > > 5} > > ============================== > > > > trace'5"' > > --------------- 6 Bident ----- > > 5 > > " > > 5" > > ============================== > > > > It did not help me much. Just in case, I tried the verb which started > this > > thread, > > > > ( S=. '(<(<,'':''),<(<(,''0'');1),<(,''0'');1 0$'''') (1 : ''u u`:6`:6 > > y'')' ) > > (<(<,':'),<(<(,'0');1),<(,'0');1 0$'') (1 : 'u u`:6`:6 y') > > > > trace S > > --------------- 4 Conj ------- > > 1 > > : > > 'u u`:6`:6 y' > > 1 : 'u u`:6`:6 y' > > . > > . > > . > > > > --------------- 8 Paren ------ > > ( > > <(<,':'),<(<(,'0');1),<(,'0');1 0$'' > > ) > > ┌────────────────┐ > > │┌─┬────────────┐│ > > ││:│┌─────┬────┐││ > > ││ ││┌─┬─┐│┌─┬┐│││ > > ││ │││0│1│││0│││││ > > ││ ││└─┴─┘│└─┴┘│││ > > ││ │└─────┴────┘││ > > │└─┴────────────┘│ > > └────────────────┘ > > --------------- 3 Adverb ----- > > <(<,':'),<(<(,'0');1),<(,'0');1 0$'' > > 1 : 'u u`:6`:6 y' > > <(<,':'),<(<(,'0');1),<(,'0');1 0$'' (1 : 'u u`:6`:6 y') > > ============================== > > |syntax error: trace > > | <(<,':'),<(<(,'0');1),<(,'0');1 0$''(1 :'u u`:6`:6 y') > > > > but at the crucial moment trace got bitten by the bug! :) > > > > (It was a long shot but I aimed for an updated j808 DLL on the > > System/Installation/Zips page, > > > > https://code.jsoftware.com/wiki/System/Installation/Zips > > > > but I got only broken links (which presumably they will be operating in > the > > future).) > > > > Alright then, can Marshall's formal parser, > > > > https://code.jsoftware.com/wiki/User:Marshall_Lochbaum/Formal_Parser > > > > help? > > > > parse@:splitwords'5}' > > ┌─────────────────┐ > > │┌─┬─────┬───────┐│ > > ││1│┌─┬─┐│┌─────┐││ > > ││ ││2│}│││┌─┬─┐│││ > > ││ │└─┴─┘│││0│5││││ > > ││ │ ││└─┴─┘│││ > > ││ │ │└─────┘││ > > │└─┴─────┴───────┘│ > > └─────────────────┘ > > parse@:splitwords'5"' > > ┌──────────────────────────┐ > > │┌─┬────────┬─────────────┐│ > > ││1│┌─┬────┐│┌─────┬─────┐││ > > ││ ││3│hook│││┌─┬─┐│┌─┬─┐│││ > > ││ │└─┴────┘│││3│"│││0│5││││ > > ││ │ ││└─┴─┘│└─┴─┘│││ > > ││ │ │└─────┴─────┘││ > > │└─┴────────┴─────────────┘│ > > └──────────────────────────┘ > > > > I still did not see why 5} can be considered to be reduced but 5" is not > > (incidentally, "bident" instead of "hook" would be a better word in this > > case, among other things). > > > > How about the troublesome sentence S? > > > > parse@:splitwords S > > > > (I am skipping the output because it would look too messy in the archive; > > but, the resulting tree is shallow.) > > > > You mentioned the stack and a reducing the number of items in the parse > > representation and I finally remembered Roger Stokes' excellent > Evaluation > > in Slow Motion (EVM), > > > > '5}'EVM > > 5} > > ┌─┬─┐ > > │5│}│ > > └─┴─┘ > > hist'' > > > > Queue Stack Rule > > > > ┌────────┐ ┌──────┬────┬───┐ ┌────┐ > > │mark 5 }│ │ │ │ │ │ │ > > ├────────┤ ├──────┼────┼───┤ ├────┤ > > │mark 5 │ │ } │ │ │ │ │ > > ├────────┤ ├──────┼────┼───┤ ├────┤ > > │mark │ │ 5 │ } │ │ │ │ > > ├────────┤ ├──────┼────┼───┤ ├────┤ > > │ │ │ mark │ 5 │ } │ │adv │ > > ├────────┤ ├──────┼────┼───┤ ├────┤ > > │ │ │ mark │ 5} │ │ │ │ > > └────────┘ └──────┴────┴───┘ └────┘ > > > > '5"'EVM > > 5" > > ┌─┬─┐ > > │5│"│ > > └─┴─┘ > > hist'' > > > > Queue Stack Rule > > > > ┌────────┐ ┌──────┬────┬───┐ ┌──────┐ > > │mark 5 "│ │ │ │ │ │ │ > > ├────────┤ ├──────┼────┼───┤ ├──────┤ > > │mark 5 │ │ " │ │ │ │ │ > > ├────────┤ ├──────┼────┼───┤ ├──────┤ > > │mark │ │ 5 │ " │ │ │ │ > > ├────────┤ ├──────┼────┼───┤ ├──────┤ > > │ │ │ mark │ 5 │ " │ │bident│ > > ├────────┤ ├──────┼────┼───┤ ├──────┤ > > │ │ │ mark │ 5" │ │ │ │ > > └────────┘ └──────┴────┴───┘ └──────┘ > > > > I must be blind, I cannot see the difference; they look eerily similar to > > me. Right, the adv rule reduces the number of items in the stack; but, > so > > does the bident rule. > > > > The bad news (for me) is that I am still in the dark. The good news is > > that I can safely assume that knowing the difference is irrelevant for > > programming which could suggest moving any potential additional > discussion > > on this particular topic to the chat forum. > > > > P.S. I find the history of '(<(<,'':''),<(<(,''0'');1),<(,''0'');1 > > 0$'''') > > (1 : ''u u`:6`:6 y'')'EVM quite interesting. > > > > > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
