A Hypertalk puzzle - The Winkler test
Posted: Thu Jun 01, 2017 1:02 pm
The following was used by Rebecca Bettencourt to test the parsing of her openxion non gui version of hypertalk. She called it the Winkler Test
Craig I know you like to ponder puzzles like "does LC do it the same way as HC did?" so this ones for you.
OpenXion passed the test but try as I might I cannot get livecode to swallow this whole without major changes especially the last bit of the repeat.
I'm assuming that the missing quote at the end of the PUT line is not an error and Hypercard even parsed that "correctly".
It is basically counting from 1 to 2 and I can get the separate parts to compile by renaming the keyword variables ie aword, achar and aitem but they will not compile within the repeat loop, is this a regressive bug that Mark should be made a ware of
the correct output is
I don't know whether Dan Winkler coded Hypertalk) or whether it was Bill Atkinson coded both the Hypercard and the language created by Winkler but it certainly shows progtramming prowess in the extreme to do all this in 68000 Assembly code.
Even more Kudos to Tom Pittman createing a full compiler that spit out 68000 machine code all in in Hypertalk itself.
Oh and Rebecca passing this test using Java - How about here on the Team she did her dissertation on a Hypercard like language
Craig I know you like to ponder puzzles like "does LC do it the same way as HC did?" so this ones for you.
OpenXion passed the test but try as I might I cannot get livecode to swallow this whole without major changes especially the last bit of the repeat.
I'm assuming that the missing quote at the end of the PUT line is not an error and Hypercard even parsed that "correctly".
It is basically counting from 1 to 2 and I can get the separate parts to compile by renaming the keyword variables ie aword, achar and aitem but they will not compile within the repeat loop, is this a regressive bug that Mark should be made a ware of


Code: Select all
put empty into a
put "a b c" into item
put 1 into char
put 2 into word
if true then repeat with word char of item = char char to word of word char of char to word char to char of char char of word
put a&&"HyperTalk is a bitch to parse
end repeat else beep
1 "HyperTalk is a bitch to parse
2 "HyperTalk is a bitch to parse
I don't know whether Dan Winkler coded Hypertalk) or whether it was Bill Atkinson coded both the Hypercard and the language created by Winkler but it certainly shows progtramming prowess in the extreme to do all this in 68000 Assembly code.
Even more Kudos to Tom Pittman createing a full compiler that spit out 68000 machine code all in in Hypertalk itself.
Oh and Rebecca passing this test using Java - How about here on the Team she did her dissertation on a Hypercard like language
I'm Not Worthy!