00:00:00 --- log: started forth/05.12.06 00:41:39 --- join: bbls (n=bbls@81.180.7.4) joined #forth 00:41:43 hello 00:41:55 any of you know any other langauge similar in simplicity with forth? 00:42:17 mmmm 00:42:18 lisp? 00:42:30 hmm, it's very large 00:42:38 let me ask something 00:42:46 would a language similar to forth 00:43:05 using automatic parameter namig 00:43:10 would it be useful? 00:43:13 like this: 00:43:25 a,b,c,d, and all single letters are reserved for parameters 00:43:26 now 00:43:36 : power a a * 00:43:46 or 00:44:04 : average a b + 2 / 00:44:32 so instead of using the stack for parameters you use those predefined parameters 00:44:40 what do you think about it? 00:44:48 sounds like locals 00:45:11 not necesarly locals, more like parameters that don't have to be declared 00:45:13 s/power/squared/ 00:45:18 ah, yes 00:45:32 what's the point? 00:45:43 i would find it much easier to use than the standard forth 00:45:47 seems simpler to just do: : squared dup * ; : average + 2 / ; 00:46:11 yes but it's not clear enough for the reader what exactly you do there 00:46:25 it is if they can read forth 00:47:20 stack comments are good 00:47:23 i'm trying to create a very small programming language, based on forth 00:47:30 but more useable 00:47:38 usable for whom? 00:47:57 in what way? 00:48:26 i like forth just that unlike any other language i'm not able to code anything reasonably large and useful with it :) 00:48:28 you may be barking up the wrong tree here, as I find forth to be more usable than any other language I've used 00:48:46 that's odd 00:49:07 bbls: Possibly (like with most languages) how extensible it is depends on how you code with it. 00:49:13 I made a delightfully effecient IDE in it 00:49:35 amca_ it's mostly related to the fact that forth syntax require a very unnatural way of thinking for me 00:49:40 JasonWoof link? 00:49:52 jasonwoof.org/herkforh 00:49:56 oops 00:50:03 http://jasonwoof.org/herkforth 00:50:13 bbls: Ah, I see. Makes sense. It is a very different approach of coding. 00:50:36 bbls: part of the beauty of forth is that it encourages different programming methods and even thinking methods 00:50:46 amca_ so i'm looking for something like forth just more familiar 00:50:51 JasonWoof i don't think so 00:50:52 I find that I have learned to be a much better programmer as a result 00:51:10 forth is a programming style as much as a language 00:51:27 if you try to program as though you were working in C you'll get quite frustrated and write crappy code 00:51:27 just doing things differently is not good if it's done just for the sake of doing it differently 00:51:33 Can you code spagetti code in Forth? I cant think of how. 00:51:53 JasonWoof it's not about that 00:51:55 bbls: it's not different for the sake of different. 00:52:06 it's different because we think this way is better 00:52:07 i understand the reason certain forth features work like that 00:52:15 i've implemented a native forth too 00:52:19 Does anyone in here do substantial X/Win32 GUI coding in forth? 00:52:19 because you can write stuff 10x smaller 10x faster etc 00:52:23 just that i don't find it useful 00:52:38 forth syntax really cumbersone 00:52:48 there has to be a way to get a more familiar syntax 00:52:57 bbls: Have you tried coding practical utils/apps in Forth? 00:53:00 and this is what i'm looking for 00:53:01 amca_: slava is making something vaguely forth-like with GUI support, as am I. his is further along (factor) 00:53:07 amca_ yes 00:53:17 JasonWoof factor is still too forth-like 00:53:34 i would like something with features like factor 00:53:37 but a different syntax 00:53:43 something that can be used easier 00:53:43 so why are you here? 00:53:49 JasonWoof: Ah, yes. Ive talked with slava about Factor. I didnt realise it was going to have GUI support 00:53:51 this is a room full of people who like forth 00:54:07 because i can't find people with the right state of mind elsewhere :) 00:54:13 I didn't realize factor had anything but a GUI 00:54:32 earlier versions had only console 00:54:34 JasonWoof: I just read about the OO features so far 00:54:35 I haven't personally run Factor, just saw it running, and it was graphical 00:55:01 crc: With the Win32 access in rf, you could write Win GUI apps with the Win32 API couldnt you? 00:55:21 (except crc isnt here) 00:55:43 amca_: I wrote a virtual machine in C using SDL for input and graphics support 00:55:52 amca_: and compiled and tested it both on Windoze and ppc linux 00:56:08 amca_: And I'm writing a colored forth for it 00:56:33 amca_: I got the compiler and bootstrapping stuff done, now I'm starting on the editor 00:57:04 I'm hoping to have it at a state where it can sustain it's own development in a few months 00:58:02 bbls: I find forth to be pretty close to ideal as far as the syntax and the way you express stuff 00:58:03 Cool 00:58:09 called mist 00:58:19 doesn't really do anything atm 00:58:23 Ah, yes. I have sen mist on your site 00:58:31 s/sen/seen/ 00:58:32 you can execute stuff but not alter definitions or add new ones 00:58:37 oops :) 00:58:43 it's coming along quit equickly 00:58:59 JasonWoof the postfix notation is reall cumbersome 00:59:19 bbls: it takes some getting used to, I'll give you that 00:59:30 bbls: If you find the postfix notation cumbersome, then I dont think Forth is the lang for you. 00:59:38 but after a while it's quite natural, and to me much clearer in some cases 00:59:43 as i said i've already coded a forth system 00:59:47 amca_: Myself I dont so much find it cumbersome as just different 00:59:57 and i'm quite convinced now that postfix is not usable enough 01:00:05 Interesting 01:00:30 the problem is that it doesn't allow you to observe in one sight the flow of computation 01:00:34 --- nick: amca_ -> amca 01:00:45 C: 1 + 2 * 1 + 2 01:00:45 forth: 1 2 + 1 2 + * 01:00:55 personally, I find the latter to be easier to read 01:01:08 Me too. You dont haved to worry about precedence 01:01:10 in C you have to scan the whole expression to devine the structure 01:01:14 for example (1 + (3 + 4)) will allow you to see instantly the flow of computation (how each value participates in the computation) 01:01:17 in forth you can read it left to right 01:01:48 3 4 + 1+ 01:02:54 wow 01:02:59 yes but it doesn't allow you to you the visual part of the brain to *see* the computation 01:03:02 see, there's a bug in the C version above, and I didn't notice it until now 01:03:12 Myself, I wish postfix, not infix notation was taught in math at schools 01:03:36 bbls: it uses the symbolic logic part of your brain to _read_ what it does 01:03:53 in fact prefix is actually better than postfix since natural languages grammar favour verb first rather verb last 01:04:08 bbls: Your brain is just not trained to read the postfix pattern. It is too used to the infix pattern 01:04:14 bbls: I dissagree 01:04:21 i don't want to read, i want to *see* 01:04:27 Not all languages. Use LISP then :) 01:04:50 i want it to jump in my face 01:05:04 [i don't know the english translation for above :)] 01:05:09 bbls: Retrain your brain so that you see, instead of read, postfix then. :) It is just a cultural thing, not an inate thing. 01:05:15 again 01:05:26 using visual clues is much better 01:05:34 since the brain is optimised for this 01:05:40 ?? 01:05:43 How do you mean? 01:05:55 Having brackets etc means more for the brain to have to process 01:05:59 the brain is optimised to *see* things, not to *read* things 01:06:00 bbls semes to be very right-brain dominant 01:06:12 JasonWoof: Ah, I see. 01:06:16 :) 01:06:51 Again, whether you "see" or "read" something is a matter of training, not instinct. 01:06:54 I'm not sure I totally even follow your point about seeing program flow 01:06:54 amca brackets act as visual walls, they don't require that much processing 01:07:06 in forth you don't need to see it because it always goes straight to the right 01:07:10 no bipping around 01:07:15 well that's the problem 01:07:25 bbls: Proper white space can fulfill the same job (eg Python) 01:07:27 the brain uses another method 01:07:27 not for me, I love that 01:07:51 * amca shrugs 01:07:51 it doesn't use a linear approach in computation but more a top-down view similar more to functional programming 01:07:55 Different strokes.... 01:08:06 I was thinking that I may at some point add little lines in my editor that go from the begining to end of control constructs 01:08:30 as they are the exception to the dead simple straight to the right control flow normal to forth 01:08:42 Interesting 01:09:18 : foo 1 2 + if 4 + then . ; 01:09:18 ----------- 01:09:25 using a linear flow control like forth requires you to remember the state of the machine 01:09:42 bbls: yep 01:09:45 this is very difficult 01:09:55 bbls: and understanding complex expressions requires you to remember that stuff too 01:09:58 using a visual structure doesn't require this 01:10:08 at least you can see where thigs go in (1 + (3 + 4)) 01:10:25 bbls: Yes it does. Your brain has to sort of cache" the bracket expressions. 01:10:37 I don't think tehre's anything more to remember in that than in: 3 4 + 1 + 01:10:38 yes but it' 01:10:53 JasonWoof: So use lines to underline parsing expressions? 01:10:57 it's optimised to cache visual data rather than symbolic state data 01:11:09 not parsing 01:11:25 control constructs 01:11:27 Sorry, misread it and forgot my Forth >.> 01:11:42 there's no parsing in my compiler 01:11:52 I like that idea 01:12:14 amca: I don't think the notation you use effects whether the number seven is visual data or symbolic stata data 01:12:23 either way you have to remember that there's a seven there 01:12:54 JasonWoof: Do you know if factor is a type of forth? 01:13:26 amca: depends totally on your definition of forth 01:13:53 Is it a type of Postscript? ;) 01:13:53 I lean towards "no" personally 01:14:03 Why do you lean towards "no"? 01:14:04 certainly not postscript 01:14:19 hehe, yeah, that was supposed to be me joking about PS 01:14:23 because of all the lists and datatypes and stuff 01:14:28 well it's a stack based postfix with 2 stacks in core and 2 other as libs 01:14:32 different syntax 01:14:51 I call it forth-like 01:14:57 but whatever 01:15:09 all this means is that my definition of "forth" is a bit more specific than others' 01:15:48 bbls: yes, that's another reason. iirc it's postfix syntax. whereas forth is not, it just looks like it sometimes 01:16:16 factor has some sorts of syntax checking 01:16:19 JasonWoof: What is your definition of Forth? 01:17:11 stack-based lang with the standard words like : ; if then dup drop swap >r r> etc 01:17:24 compiler/interpreter reads words in one at a time and dispatches them 01:17:32 two integer stacks 01:18:12 and you can write words that read in the next characters/word(s) from the code 01:18:53 that's what comes to mind atm 01:19:16 factor differs in at least the middle two 01:19:36 well, it's nice chatting, but I plan to get up in 6 hours, so I think I'll be off 01:20:05 hmm 01:20:19 do you think if it would be possible to create some kind of visual forth? 01:20:25 oh, and the immediates bit 01:20:39 Ok. Cya JasonWoof ! 01:20:45 bbls: How do you mean? 01:20:45 bbls: no idea what that means to you 01:20:54 some sort of very simple and intuitive flow-like language 01:21:04 * JasonWoof waves and wanders off 01:21:04 (using graphical representation) 01:21:08 bye JasonWoof 01:22:39 bbls: Like have boxes that represent specific words that you graphically connect? 01:22:58 something like that 01:23:35 do you run windows? 01:24:16 i've found some time ago a such program but it's not developed enough and it's slow to work with 01:24:22 http://mindscript.sourceforge.net/ 01:25:06 +---+ +---+ +---+ +---+ +-----+ 01:25:06 | 1 |<---| 1 |<---| + |<---| . |<---| bye | 01:25:06 +---+ +---+ +---+ +___+ +-----+ 01:25:13 Something like that? 01:25:30 And you could double click on a box to access its definition 01:25:38 check mindscript 01:25:44 * amca looks 01:26:13 you could mouse over a box and a small window would appear next showing that part that contains the definition 01:29:41 So if it was more like mindscript it would be like: 01:29:42 +---+ +---+ +-----------------+ +----------+ +-----+ 01:29:42 | 1 |<---| 1 |<---| + |<---| . |<---| bye | 01:29:42 +---+ +---+ |-----------------| |----------| +-----+ 01:29:42 | ( n1 n2 -- n3 ) | | ( n -- ) | 01:29:42 +-----------------+ +----------+ 01:29:44 ? 01:30:03 --- quit: JasonWoof ("off to bed") 01:30:25 the definition would appear only when you mouse over 01:30:36 * amca nods 01:30:39 otherwise the view space would be too polluted 01:30:47 have you checked mindscript? 01:30:52 yep 01:31:19 In mindscript, it seems to have the list of parameters below the name of the function 01:31:19 just checked the site or also tried it? 01:31:24 yes 01:31:30 So I was emulating that with stack diagrams 01:31:38 just checked screenshots 01:32:50 you should run it too to see what i mean by slow 01:32:55 Could you do an ascii diagram on a nopaste site showing more how you would see the Forth words rendered? 01:33:01 I believe you about the slow part 01:33:10 not that it runs slow 01:33:13 something else 01:33:38 too much mose->keyboard->mouse switch 01:34:01 mose = mouse? 01:34:05 there should be a way to do this thing either using only keyboard or using mouse + WASD keys 01:34:09 yes, mouse :) 01:34:27 w,a,s,d and keys around 01:34:28 You cant type in with only wasd :) 01:34:37 since that's very handy to most users 01:34:42 (many quake players :)) 01:34:48 yes 01:34:59 hehe. otherwise all your forth words will be wasd, wdas, dsaa etc :) 01:35:00 so the interface has to be somehow made faster to work with 01:35:16 for example using INSERT to insert a new node 01:35:29 or ctrl+ins and ctrl+del 01:35:55 but not needing to insert a new node for each token 01:36:25 it would be cumbersome to have to insert manually 4 nodes for 1 1 + . 01:37:41 Show me an ascii diagram of how you think it would work, please. 01:37:53 well this is what i'm trying to figure out 01:38:05 maybe do something in ms paint :) 01:38:14 it's hard to do an ascii diagram 01:39:17 just that i'm not sure yet how it should look 01:39:29 well do it in mspaint then :) 01:40:37 This is the best I can come up with that blends Forth and Mindscript: http://www.rafb.net/paste/results/f7Yhrr49.html 01:41:22 well that's more or less forth 01:41:33 it adds no extra useful things from basic forth 01:41:48 Visual interface? 01:42:03 It looks pretty much the same as what mindscape does 01:42:33 Anyway, think on it and get back to me with a diagram of how you would like to see a postfix/forth language coded visually. 01:42:33 yes but it's just same as "1 1 + . bye" 01:42:57 hmm 01:43:32 i've just got one idea 01:43:36 wait to draw it 01:44:12 how is http://mindscript.sourceforge.net/screenshotÊ0040731-1.gif different from "frrgg(String, Integer); jhmmjjhm(String);" ? 01:44:15 I will 01:44:23 how is http://mindscript.sourceforge.net/screenshotÊ0040731-1.gif different from "frrgg(String, Integer); jhmmjjhm(String); ... etc" ? 01:45:27 rather ""jhmmjjhm(rrgg(String, Integer));" 01:45:45 s.rrgg/frrgg/ 01:45:49 s/rrgg/frrgg/ 01:48:06 does dcc works for you? 01:49:27 amca ? 01:51:49 sorry - distracted 01:51:53 try it 01:52:22 tIf not Ill notice you my email 01:53:00 have you accepted? 01:53:07 oh 01:53:08 Nada 01:53:10 wait i have to login 01:53:15 lol 01:53:29 now? 01:53:57 Ive accepted 01:54:08 ok it doesn't work 01:54:10 give me email 01:57:19 still here? 01:57:22 yep 01:57:32 Ill let you know when I go permanently 01:57:56 ok 01:58:01 but where to send it? :) 01:58:38 this is some sort of evrika :) 01:58:50 really good idea of display (in my opinion) 01:59:18 Sorry, Im not sure what yuou are saying 01:59:28 Did you get my /notice? 01:59:29 give me that damn email address! 01:59:31 no 01:59:32 i haven't 01:59:33 ah 01:59:39 you have to be logged in order to send 01:59:41 a message 01:59:49 I know. Im identified 01:59:52 hmm 01:59:59 give it on private 02:00:18 actually I may not have been >.> 02:00:24 oh :) 02:00:25 get it then 02:00:26 now i see 02:00:26 ? 02:00:46 i see the message 02:00:51 * amca nods 02:00:56 it's interpreted from top to down, from left to right, the rectagles can be divided in any way 02:01:05 I actually identified just then >.> 02:01:23 Could you please try dccing it again to see if that works or not on Freenode? 02:01:36 ok 02:02:13 sent dcc file 02:02:25 Nope, dcc doesnt seem to be working 02:02:33 ok, i've sent email 02:03:11 tnx 02:03:17 got it? 02:03:24 Ill let you know when received 02:03:31 receiving it now 02:04:01 you have to read it from top to down and from left to right 02:04:42 Dont you mean first read it left-to-right, then top-to-bottom? 02:04:56 hmm, you will figure out 02:05:05 it's 1 3 4 + + . bye 02:05:11 : test_word 1 3 4 + + . bye ; 02:05:23 that's what I guessed it was :) 02:05:34 so what do you say? 02:06:00 --- join: swalters (i=swalters@6532183hfc82.tampabay.res.rr.com) joined #forth 02:06:06 this idea comed to me just now 02:06:06 it is better to do it : test_word 1 3 + 4 + . bye ; as it uyses less of the stack and is easier to read 02:06:22 when talking to you :) 02:06:32 I think having it read top to bottom as well as left to right is a bit confusing for me 02:06:43 well just look for how is divided 02:06:46 I would prefer it either left to right, or top to bottom 02:06:56 * amca nods 02:06:56 small rectangles contained in larger ones are parameters 02:07:04 Im just saying my personal prefs 02:07:37 forth doesnt really work like that in my mind. In my mind, each box opperates on the stack 02:07:55 yes but you don't really have to *read* it, it can be *seen* 02:08:17 i understand what you mean, but this kind of view seems more intuitive 02:08:40 Whatever floats your boat. My brain sees linearly, not holistically 02:08:56 hmm, ok but is it usable in general? 02:09:00 compared to mindscript? 02:09:09 How would you do is like : test_word 1 3 + 4 + . bye ; ? 02:09:18 I may understand it better if you do it in that order 02:09:31 ok wait to draw 02:09:49 * amca waits 02:09:58 Can I ask where you are from please? 02:10:14 romania 02:10:20 Cool 02:10:25 Im from Australia 02:10:57 If it is any use, I think you rendered it very cleanly and elegantly :) 02:12:06 let me know when sent pls 02:12:15 ok 02:12:18 still drawing 02:12:20 finishing soon 02:12:26 * amca nods 02:12:28 I guessed 02:15:25 finished 02:15:28 sending 02:16:04 tnx 02:16:59 Ill let you know when Im receiving it 02:17:14 i've sent it now 02:19:02 receiving 02:20:22 the red arrows help a lot with cues :) 02:20:43 sending another one 02:21:07 the 4 box would be better if the arrow was L shaped instead of V shaped 02:21:30 ah, yes, true 02:22:15 like on the Enter key 02:22:50 only mirrored left-right 02:23:05 ok, new message sent 02:23:18 it's same function with some more visual clues 02:23:20 What about trying reversing the top-down/left-right order? 02:24:25 The yellow I understand, but I dont get the significance of the blue boxes 02:24:48 it groups thigs that can be independant 02:24:53 1 3 + 02:24:59 could be a separate word 02:25:14 if you understand what i mean.. 02:25:34 I would have done it: with the 2nd + taking up a whole line, so that you can see the blue boxes are the params easier 02:26:00 ah 02:26:09 and place . bye under 2nd + ? 02:26:15 And you didnt change the 4 arrow to 'L' either 02:26:19 yep 02:26:31 well that thing i read after drawing 02:26:36 ah ok 02:26:55 like have parameters left to right, and next word below 02:26:55 ? 02:27:02 if i change with + tanking whole line the arror doesn't have to be changed 02:27:12 *taking 02:27:16 *arrow 02:27:18 Good point 02:27:19 yes like that 02:27:30 parameters on top 02:27:40 And if you do it like that, you dont need blue boxes 02:27:47 yeah 02:27:52 wait to redraw 02:28:02 ok 02:32:38 --- join: amca_ (n=plump@as-bri-3-64.ozonline.com.au) joined #forth 02:33:00 bbls: sorry, dc'd 02:34:15 --- quit: amca (Nick collision from services.) 02:34:23 --- nick: amca_ -> amca 02:35:22 http://www.rafb.net/paste/results/oeGeaG71.html <-- my go 02:36:53 bbls: Sorry, but I have to hop offline now 02:37:03 ttyl 02:37:06 --- quit: amca (Client Quit) 02:55:31 --- join: segher (n=segher@blueice4n1.de.ibm.com) joined #forth 03:20:52 --- join: amca (n=plump@as-bri-3-132.ozonline.com.au) joined #forth 03:23:31 --- join: amca_ (n=plump@as-bri-3-132.ozonline.com.au) joined #forth 03:23:35 --- quit: amca (Client Quit) 03:23:52 --- quit: amca_ (Read error: 104 (Connection reset by peer)) 03:24:03 --- join: amca (n=plump@as-bri-3-132.ozonline.com.au) joined #forth 03:25:26 bbls: You on? 03:25:53 yes 03:26:01 cool 03:26:03 wait to send another 03:26:08 Will do 03:26:19 it's just a small variation 03:26:26 actually i tought same thing as you 03:26:34 you will see what i mean in the picture 03:26:51 Did you look at http://www.rafb.net/paste/results/oeGeaG71.html ? 03:28:54 yes but after i drawed last image 03:29:02 message sent 03:29:02 Another thing for you to consider: how would it deal with parsing words? 03:29:05 tnx 03:29:16 parsing words? 03:29:29 let me give you an example 03:31:09 s" is a parsing word, because it takes the next word on the input stream 03:31:19 as opposed to off of the stack 03:31:19 ah 03:31:19 hmm 03:34:14 parsing words could appear as a call 03:34:23 and the "parameter" would be what should be parsed 03:36:32 Could you give an example of 's" Hello" type bye' pls? 03:37:15 wait to draw 03:37:53 The second of the diagrams, and without the arrows - they are superflous now 03:38:05 yes, tought so 03:38:51 I must say, I like what you/we are coming up with as a visual representation of forth :) 03:43:03 :) 03:44:03 I would like to see you code an example of an app that renders graphically a Forth program. :) 03:48:28 finished drawing 03:48:48 sent? 03:48:51 not yey 03:48:54 not yet 03:48:58 ok 03:50:01 mail sent 03:50:05 k 03:51:02 receiving 03:51:51 the second 03:52:16 except dont use pink for parsing words please. Blue or green. :) 03:52:20 :0 03:52:36 the actual color and style would probably have to be configurable 03:52:44 * amca nods 03:52:52 pink is too girly for my tastes 03:53:04 :) 03:55:15 i've started working on app that renders 03:55:19 using HTML tables 03:55:38 hmm 03:55:41 there is one problem 03:55:49 cool 03:55:51 What 03:55:52 ? 03:55:57 one huge problem 03:56:08 forth doesn't have the concept of "parameter" 03:56:15 Yes it does 03:56:31 you don't declare parameters in function prototype 03:56:48 how do i know then how to group the rectangles? 03:56:51 It would have to look at the stack diagram in the code 03:57:12 eg : plus ( n n -- n ) + ; 03:57:22 yes but stack diagram is not mandatory 03:58:10 But it could be for use of your renderer, and where there isnt a stack diagram, a parameter of 0 could be assumed 03:58:57 as in it could assume the word has zero stack parameters (which looks exactly the same as 1 stack parameter in the diagram) 03:59:48 i'm just afraid that this representation is not suitable for forth 04:00:19 in pure forth how do you know when to exit immediate mode? 04:00:50 because afaik in pure forth the immediate mode function will modify parser's text pointer 04:01:11 Not any differently from compile mode, does it? 04:01:37 hmm, yes but that means that you can't know what to render 04:01:56 [ and ] are used to switch between the two mode I think 04:01:59 You can 04:02:08 take for example s" 04:02:19 how do you know that s" ends at "? 04:02:22 s" hello" 04:02:23 ? 04:02:23 It would see that the definition of the word has 'immediate' in it, and color it appropriately 04:02:34 s" doesnt end at " 04:02:44 then when it ends? 04:02:46 Ah, I see what you say 04:02:50 you see? 04:02:58 now imagine a complex immediate word 04:02:59 You need to know what the delimeter is for each parsing word 04:03:15 how on earth could you know where it ends 04:03:30 But that is different from an immediate word. A parsing word isnt necessarily an immediate word is it? 04:03:31 also if you know the delimited for each parsing word then you won't be able to handle user functions 04:03:41 You would have to know how the parser works 04:03:52 Why not? 04:04:00 well not sure about pure forth but in mine parse functions are immediate ones 04:04:09 : s" some_code_here ; immediate 04:04:22 the s" is executed when met during compilation 04:04:30 and it modifies the internal state of the parser 04:05:30 this representation requires a standard way to delimit macros, etc 04:05:48 hmmm 04:05:54 i would expect it to work better with something like lisp 04:06:48 Well you are going to insist that forth code that is compliant to being rendered contains information/comments to let your renderer know how to render it. 04:08:41 hmm 04:08:58 --- join: PoppaVic (n=pete@0-1pool46-229.nas30.chicago4.il.us.da.qwest.net) joined #forth 04:10:35 Hi PoppaVic 04:10:45 hi amca 04:11:37 imagine for example 04:11:49 someone implementing complex numbers using a word named ccn 04:11:54 and it would work like: 04:12:06 ccn 30 39i 04:12:10 where i the terminator 04:12:28 now if you would enforce a standard terminator you would end up with a lot of pollution 04:12:39 the code would not be clean at all 04:13:02 PoppaVic: How are you going? 04:13:30 bbls: Which is why each parsing word needs to specifiy in comments its delimiter 04:13:36 in the form of a regexp 04:13:42 umm... Not feelin' too great, but.. The code is progressing and I think it'll be better for all the arguments ;-) 04:13:58 eg '\ delimeter = \"' 04:14:05 hehe 04:14:09 hmm 04:14:11 Why not feeling tooo great? 04:14:35 Some sorta' stomach-bug... Not getting much sleep, but I sure am getting back and forth to the head. 04:15:59 I think, personally, what I like best about the form is: you can leverage the hell out of a private "wordlist" 04:16:18 amca imagine list with numbers, possibly hierarhical like this: [1 2 3 [4 5] 4 [8 9]] 04:17:41 w/o context, that's pretty much a waste 04:18:24 and in ? 04:18:30 bbls: OK 04:18:46 hmm? 04:19:00 amca the idea is howhever very good, but unfortunatelly i'm not sure if it's applicable to forth 04:19:17 at least to pure/classic forth 04:19:18 I meant letting manage some of it's own parsing - like variable/constant 04:19:45 Yeah, you'd be creating a hybrid or special voc(s) 04:20:37 bbls How so? 04:21:07 PoppaVic: No, not a special voc. More like a commenting standard 04:21:10 amca because of the parsing problems, the way how immediate words work in forth 04:21:14 Like with javadoc comments 04:21:15 right 04:21:40 I had it all pretty well hammered out, on the isolated machine *sigh* 04:22:06 bbls: Can you give an example of how even with the right commenting standard, it wouldnt work? 04:22:11 amca i'll try to see if i can put togeder something forth-like that can use this 04:22:20 amca well look at the above example with the lists 04:22:28 amca you can't specify a delimiter 04:22:35 I'd recommend mostly immediate (preprocessor-like) words 04:23:06 bbls: You dont have lists like that in Forth do you? 04:23:21 amca you can have if you implement them, like in factor 04:23:44 amca you can implement them using parsers 04:24:00 for example [ would be the immediate parsers 04:24:04 No, because [ and ] are used for compilation mode 04:24:05 amca *parser 04:24:16 well that's just a detail 04:24:26 you could have chosen *[ and ]* 04:24:35 Okay 04:24:38 No probs 04:25:30 so please shpow me a simple recursive example of using *[ as delimeters? 04:26:52 *[ 1 2 3 [4 5 6] [5] 3 5] 04:28:04 wouln't it be *[ 1 2 3 *[ 4 5 6 ]* *[ 5 ]* *[ 3 5 ]* ? 04:28:42 no as that would be too difficult to read and write 04:31:41 Well where you have { word }{ parsed text }, it would be { *[ }{ 1 2 3 *[ 4 5 6 ]* *[ 5 ]* *[ 3 5 ]* } 04:31:50 or rather 04:32:05 { *[ }{ 1 2 3 [4 5 6] [5] 3 5] } 04:33:43 Did you understand that? 04:34:31 and you could have something like "\ recursive-delimeters = [ ]" 04:37:43 well any way you do it you can't do it with existing forth implementations 04:38:47 you can. It is a programming style issue, not a forth implementation issue 05:41:20 Is it possible to have an immediate form of 'variable' so that you can declare variables in word definitions? 05:43:59 hmm? 05:44:03 sure, I suppose 05:44:30 however, remember: yer already in the process of "compiling" a word - where would the new var go? 05:44:44 Hmm 05:44:54 As a new word 05:45:04 A new word gets compiled in the middle of an old one 05:45:09 Not really practical eh? 05:45:09 or, are you talking about _embeddeding_ the var right in the word? 05:45:33 Well the plan is to define it in the word, then once it is used, get rid of it 05:45:37 yah, yer tryingto mix-metaphores 05:45:39 i.e. use it as a local var 05:45:43 ahhh 05:45:53 that's why the stacks are there 05:45:53 I suppose I could allocate it on the heap 05:46:30 I want to use a variable to make my code more readable - I actually just need to use a temporary constant I suppose 05:46:43 I think I see what you want, but forth just doesn't want to play that way 05:47:05 Perhaps it _would_ be best to use the localvar stuff? 05:47:06 gforth has local vars :P 05:47:22 yeah, but they are really, really weird 05:47:36 Well I would, but I wanna use local vars in the portable way possible for forth 05:47:54 Cause I wanna port my code to rf 05:48:10 I think... I might consider a hidden 'word' only used by the func yer writing 05:48:38 prob is, it won't allow for recursion/reentrant 05:49:09 hmm 05:49:20 yeah, it needs to be reentrant 05:49:35 Ill have to use gforth locals, and just figure out how to port it to rf 05:49:36 I'd instead consider tucking some space under the vars you plan to consume 05:49:48 eg? 05:49:50 vars/slots 05:49:59 well, show me a proto for the func 05:50:50 k 05:50:58 just the stack-comment 05:51:17 Ill show you what I would like to do 05:51:30 sure - lemme see the i/o 05:53:12 http://rafb.net/paste/results/vVirrC74.html 05:53:28 where [constant] is an immediate form of constant 05:53:32 ie a local one 05:54:15 that's just... nasty 05:54:37 all you need is the literal itself, man 05:55:03 --- nick: Raystm2 -> nanstm 05:55:05 but I dont want just the literal - it is not good for code readability 05:57:44 I want a local variable 06:00:54 use the stack, luke 06:01:05 ok, the prob is that forth wants you to use the stack. 06:01:28 I just tried about 3 ways to embed a lit and use it's address, and you STILL need the stack, dude. 06:01:58 I want to use a local variable as a named parameter on the stack 06:02:07 I understand that 06:02:17 that way I dont have to have the stack too deep with local vars 06:03:56 the main thing I am trying to do is have more self docu,menting code 06:09:01 it's just not gonna' happen w/o locals - and I don't like the solutions I see. 06:09:39 * amca nods 06:09:54 I could always cheat and use cpp 06:10:04 meh 06:11:23 I'd just write a special voc 06:12:14 Well my mind is closer to the solution it wants anyway 06:12:47 hmm, I've just decided I need to decompose ini_load() about 3 ways *sigh* 06:13:31 So much for trying to use the KISS primciple. 06:13:36 decompoise? 06:14:18 yeah.. If I plan to load 1..N .ini, and use one database, I have to have an _open/_close and _load 06:15:12 open once, load N, and go for it until close 06:15:45 where N =? 06:15:49 right 06:16:27 I'm still of opinion we want /etc ala' admin/root, ~user would be prefs, and ./ would be the package/project 06:17:59 no, I meant wtf does N mean? 06:18:07 umpty-files 06:18:12 more than 1 06:19:03 those would be _source_ - the ini - not database. The latter would act as the "accumulator" 06:19:47 bbiab gotta go get milk 06:20:03 * amca is away: shopping 06:37:31 dang I didn't give amca my list 06:38:05 he shall return ;-) 06:38:26 famous last words for 200, Alex. :) 06:43:07 * amca is back (gone 00:22:58) 06:43:52 Ray_work: :P 06:43:56 you didn't shop very long? 06:44:04 Only got milk 06:44:17 at the 7-11. It is 00:45 here 06:44:21 wb 06:44:34 thanks 06:44:40 * PoppaVic reserves a "Toldya' so" ;-) 06:44:51 hehe 06:44:52 new milk add: "Only got milk!" 06:44:59 Ray_work: lol 06:45:02 So what is this list? 06:45:53 Oh, I need something for Nan's Birthday, 5 days before Christmas, then I need a Christmas gift for her and NO you can't combine them. 06:46:33 yes, you can ;-) 06:46:34 9 days before her birthday, I need an aniversary gift, 17 years. 06:47:35 Piss poor planning: you shoulda' at least combined two ;-) 06:47:40 hehe 06:47:43 PoppaVic: I can use marker in gforth to do what I want 06:47:55 umm, ok 06:48:02 At 10 dollars a pop, how much VIagra should I get for a 17th aniversary 06:48:43 lol 06:48:49 170 06:48:53 Viagra 06:50:29 what is the ans version of marker? 06:54:50 wish I had my "developers environment" on my @work machine. 06:56:37 Ray_work: I dont think I can help with present ideas. Im pretty crap at thinking of presents. Im better at selecting cards. 06:57:33 hmm.. an empty bag from jewlers; then an empty box from bag; then, whatever fits the box: Yer covered. 06:59:26 No one knows what the ANS version of gforth 'marker' is? 06:59:59 no idea - I'm in C-mode ;-) 07:00:27 :/ 07:00:28 :) 07:03:25 amca: it's author should know it :D 07:04:11 humulus: The author of the ANS standard? 07:05:55 amca: no the author of gforth 07:06:13 Ah 07:06:29 you were askin for the ans version of gforth 'marker' 07:06:39 Maybe I could rephrase my question then 07:06:49 How do I go about forgetting words? 07:06:50 cuz i could ask him :) 07:07:15 You know the gforth author? 07:07:20 i do 07:07:41 well there are more then one, i know one 07:07:59 i'm doin some stuff for him 07:08:36 Cool 07:08:53 I gotta' recycle anyway, so - talk to you guys later - or tomorrow... 07:08:55 --- quit: PoppaVic ("Pulls the pin...") 07:17:48 humulus: May I ask what stuff you are doing for him? 07:18:05 amca: assembler/disassembler for ppc 07:18:07 i found out that MARKER is the ANS standard forgetting word btw 07:18:17 humulus: Coded in what lang? 07:18:25 amca: make a guess :D 07:19:32 do you need a hint? 07:19:41 --- quit: bbls () 07:20:42 Well I was hoping it was gforth :) 07:21:02 good job 07:22:01 --- join: amca_ (n=plump@as-bri-3-99.ozonline.com.au) joined #forth 07:22:20 dc'd 07:22:31 humulus: Coded in what lang? 07:22:33 amca: make a guess :D 07:22:36 do you need a hint? 07:22:37 <-- bbls has quit () 07:22:39 Well I was hoping it was gforth :) 07:22:54 --- quit: amca (Nick collision from services.) 07:23:00 --- nick: amca_ -> amca 07:23:20 humulus: U still there? 07:24:45 amca: jow 07:25:04 So is it gforth? 07:25:19 yes i said good job 07:25:48 I missed that sorry 07:26:03 it's allright 07:27:18 Do you mind if I ask more about yourself and it? 07:28:24 go ahead i won't answer if its to intimate 07:30:12 cool 07:30:23 How long have you been coding in Forth? 07:31:17 since february 07:32:29 A newbie, eh? Well, an older newbie than me, anyway. :) 07:32:47 What langs have you coded in before? 07:35:19 prolog, haskell, python, c, java, mosel, c++ always wanted to do something, 07:35:27 cool 07:35:32 How long you been coding for? 07:35:40 3 years 07:35:52 still studyin' that shitt 07:37:20 plus alpha, avr assembler 07:37:51 that's impressive isn't it ;) 07:38:05 just an egotrip 07:38:15 oooh! I like what I have seen of AVR :) 07:38:49 QVR is the 8-bit RISC right? 07:38:53 Q = A 07:39:50 it's risc, it hat 8-bit, is a microcontroller, or the company produces micro controllers 07:40:35 yeah, Ive downloaded the spec sheets for it etc 07:41:01 May I ask how old you are? 07:41:28 22 07:42:00 Going to uni? 07:42:12 jow 07:42:16 Can I ask which gforth author it is? 07:44:07 http://www.complang.tuwien.ac.at/anton/ 07:44:33 * amca looks 07:45:42 How did you get coding the PPC asm/diasm? 07:46:24 i asked him 07:47:36 i attended the course stackbased lang. and finally he offered that practical course and i asked 07:49:35 You go to the same uni as him? 07:50:12 he is a prof actually 07:53:25 At your uni? 07:57:44 jup 07:58:11 You are Austrian? 07:58:17 jup 07:58:47 :) 07:59:08 So did you ask him for a coding project to do? 08:01:05 jup 08:01:23 i just have to press the up key in order to answer ;) 08:01:37 hehe 08:01:44 and [Enter] :P 08:02:03 So you started the stack course at the start of this year? 08:02:36 jup 08:03:03 When did you ask for the project? At the beginning of the year? 08:03:28 end of january 08:04:08 * amca nods 08:04:13 And been working on it ever since? 08:05:43 no 08:06:11 it's not sophisticated, i also had a freaky period 08:06:28 during the time from january till now 08:07:18 oh? Can I asked what happened? 08:07:25 no 08:07:59 i wanted to have some fun, should be enough 08:08:35 Ah. ok 08:08:41 So you are back working on it? 08:08:56 yes 08:09:09 How lobg you been back working on it for? 08:09:35 1 month effective work 08:09:45 cool 08:09:49 How is it going? 08:09:59 or even less , now really perfect 08:10:18 do you have the source online? 08:10:21 should not take too long to finish the assembler disasm 08:10:26 amca: no yet 08:10:45 what have you done so far on the project? 08:11:39 PowerPC has about 250 insns, if you don't count the dot and o variants... quite some work ;-) 08:11:53 disassembler, plus testscripts and i already can assemble the md,mds,a form sucessfully 08:12:07 segher: well the . crap you factorize that stuff 08:12:44 yeah of course... but the "more interesting" insns aren't quite that regular (read: book III insns) 08:13:06 book 3 ? 08:13:33 the ppc instructions are crazy encoded though 08:15:06 most are easy. give me some binary, i'll tell you what that insn is :-) 08:15:12 or hex rather 08:15:57 the PowerPC insn set is described in three books: book I, book II, and book III 08:20:21 segher: i want those books 08:20:51 you can download them... hang on, i'll find you the url 08:21:15 i have "PowerPC Microprocessor Family: Programming Env for 64 and 32 bit Microproc. " 08:21:27 that's the old s tuff 08:21:37 god damn it 08:21:48 i need those links :) 08:22:10 http://www.ibm.com/developerworks/eserver/library/es-archguide-v2.html 08:22:27 that's version 2.02 of the architecture (the latest public version) 08:23:48 when were those books published 08:24:25 24 Feb 2005 08:24:25 Updated 16 Nov 2005 08:24:32 that's what that page says, anyway 08:25:27 segher: i started with that crap in janaury obviously it was not avalaible 08:25:41 2.01 was... 08:25:47 segher: but the gnu binutils sources are helpfull too. 08:25:53 that was posted somewhere in 2003 08:26:13 the binutils assembler/disassembler for ppc are a mess 08:27:25 it's reasonable useful though 08:27:36 well i will get a beer, then go home, and continue hacking there 08:27:47 sounds like a plan 09:00:33 --- join: Topaz (n=top@cerberus.saywell.net) joined #forth 09:04:48 --- join: PoppaVic (n=pete@0-1pool72-40.nas24.chicago4.il.us.da.qwest.net) joined #forth 09:37:41 --- quit: amca (Excess Flood) 09:37:59 --- join: amca (n=plump@as-bri-3-99.ozonline.com.au) joined #forth 09:41:51 --- join: virl (n=hmpf@chello062178085149.1.12.vie.surfer.at) joined #forth 10:13:58 --- join: amca_ (n=plump@as-bri-4-1-93.ozonline.com.au) joined #forth 10:14:29 --- quit: amca (Read error: 113 (No route to host)) 10:23:27 --- join: I440r (n=_I440r_@rrcs-24-242-160-169.sw.biz.rr.com) joined #forth 10:23:51 --- quit: I440r (Client Quit) 10:24:13 --- join: I440r (n=_I440r_@rrcs-24-242-160-169.sw.biz.rr.com) joined #forth 10:36:22 --- quit: amca_ ("d34d") 10:46:22 --- quit: I440r ("Leaving") 10:50:26 --- quit: PoppaVic ("has to sleep - laters") 10:51:24 --- join: JasonWoof (n=jason@pdpc/supporter/student/Herkamire) joined #forth 10:51:24 --- mode: ChanServ set +o JasonWoof 11:17:22 --- quit: Topaz ("Leaving") 11:29:07 --- join: tathi (n=josh@pdpc/supporter/bronze/tathi) joined #forth 11:32:30 --- quit: segher () 14:06:08 --- quit: OrngeTide ("Lost terminal") 14:21:55 --- join: snoopy_1711 (i=snoopy_1@dslb-084-058-162-038.pools.arcor-ip.net) joined #forth 14:22:13 --- quit: Snoopy42 (Nick collision from services.) 14:22:35 --- nick: snoopy_1711 -> Snoopy42 14:49:47 hi all 15:11:57 --- quit: virl (Remote closed the connection) 15:35:00 --- nick: nanstm -> Raystm2 15:40:19 --- join: amca (n=plump@as-bri-3-118.ozonline.com.au) joined #forth 15:41:49 hi amca 15:42:09 Hi crc 15:42:21 what's new? 15:42:32 i was curious about somethin with rf, but I have to remember what it is. 15:42:34 That's it 15:43:05 Why are loc: ;loc only 4 deepable and why dont you have MARKER? 15:43:24 I never had a need to go more than four deep with loc: ;loc 15:43:33 marker can be added; I coded it once... 15:43:42 ok 15:43:47 * amca thinks 15:44:01 While I think, hoiw are you going? 15:44:21 pretty good 15:44:32 tired; but that's to be expected after working all day 15:45:45 Ive been cofding all night 15:46:46 Since win32forth has the same syntax as gforth, to avoid having to port my code, Im gonna use it for the moment. 15:47:09 ok 15:47:30 oh is that right? loc: is only 4 deepable? 15:47:43 Ray_work: Yep. RTFM. ;) 15:47:43 http://charleschilders.ath.cx:8000/marker.forth 15:47:51 * amca looks 15:48:06 this is mark/empty 15:48:45 well, isn't that 6 deep? 15:49:01 no 15:49:04 5 15:49:13 the headerless doesn't count? 15:49:21 loc: 15:49:23 loc: 15:49:25 loc: 15:49:27 loc: 15:49:30 ;loc 15:49:32 etc 15:49:33 oh nesting 15:49:35 sorry. 15:49:38 np 15:49:55 deepable ment to me that you can only have 4 defs, so solly. 15:50:08 ok 15:50:39 getting that mail together, and shutting up. 15:51:03 :) 15:51:03 --- quit: amca (Excess Flood) 15:51:30 --- join: amca (n=plump@as-bri-3-118.ozonline.com.au) joined #forth 15:52:26 --- quit: amca (Client Quit) 15:52:37 --- join: amca (n=plump@as-bri-3-118.ozonline.com.au) joined #forth 15:52:51 --- quit: amca (Read error: 104 (Connection reset by peer)) 15:53:05 --- join: amca (n=plump@as-bri-3-118.ozonline.com.au) joined #forth 15:53:24 meh. Sorry, what did I miss? 15:55:41 hello? 15:55:41 nothing 15:55:45 you missed me solving all the worlds problems. 15:55:52 nothing 15:55:58 you missed nada 15:56:00 hehe 15:56:01 ok 15:56:09 crc: Had I asked you a q? 15:56:20 amca, nope 15:57:48 Wondering about the implementation choices of rf: why is S" implementaed in a non standard way? 15:57:58 17:45] this is mark/empty 15:57:58 [17:46] [Raystm2] well, isn't that 6 deep? 15:57:58 [17:46] no 15:57:58 [17:46] [Raystm2] 5 15:57:58 [17:46] [Raystm2] the headerless doesn't count? 15:57:58 [17:46] loc: 15:58:00 [17:46] loc: 15:58:02 [17:46] loc: 15:58:04 [17:46] loc: 15:58:06 [17:46] ;loc 15:58:08 [17:47] etc 15:58:10 [17:47] [Raystm2] oh nesting 15:58:21 17:47] [Raystm2] oh nesting 15:58:21 [17:47] [Raystm2] sorry. 15:58:21 [17:47] np 15:58:21 [17:47] [Raystm2] deepable ment to me that you can only have 4 defs, so solly. 15:58:21 [17:47] ok 15:58:22 [17:48] [Raystm2] getting that mail together, and shutting up. 15:58:24 [17:48] :) 15:58:26 [17:48] *** amca (n=plump@as-bri-3-118.ozonline.com.au) has quit IRC [Excess Flood] 15:58:47 and thats about it till you rejoined. 15:58:57 amca, checking the standard.... 15:59:25 Ah. I was wondered why was booted 15:59:46 s" is standard 16:00:20 So does gforth implement s" in a non standard way? 16:00:43 no 16:01:10 Ill nopaste you the differing output to the same code 16:01:15 ok 16:03:55 If they both implement the words to the standard, it should give the same output, right? 16:04:03 http://www.rafb.net/paste/results/qH25Ve83.html 16:04:41 s" has no defined interpretation semantics according to the ANS spec 16:04:47 I see 16:04:48 so both are valid 16:04:51 doh 16:05:00 in rf, " is used for the interpret-time functionality 16:05:05 " foo" .s 16:05:45 " fdsa" " fdsfdssfd" cr .s cr type type cr 16:05:45 0 0 0 0 0 0 134661783 4 134661783 9 16:05:45 fdsfdssfdfdsf 16:06:08 Why did you choose to go that way? 16:06:53 Although I arent doing my current project in rf, I plan to do some future projects in rf. 16:07:43 I kept the historical use from earlier in Retro's history for " 16:07:52 Ah 16:08:05 when I added support for strings in a definition, I chose to use s" to follow mainstream tradition 16:08:23 what is mainstream tradition of handling it? 16:08:44 s" 16:09:02 FWIW, it looks like the File Access word set adds interpretation semantics for S" 16:09:40 tathi, I'm still working my way through CORE 16:10:29 What I meant to ask was, what is the mainstream tradition of handling s"? 16:11:24 In definitions only is all that can be relied on in my experience with various forths 16:11:37 : s" state @ if " $, ;then " ; ' .self reclass 16:11:52 :) 16:11:53 that line adds s" for both interpret and compile times 16:11:54 What is that in English? 16:12:23 if state is true (compiling), parse the string and use $, to compile it into the definition 16:12:40 if not, just parse, move to PAD, and leave the addr/count on the stack 16:12:44 ' .self reclass 16:13:01 that changes the class to ,self, which means that the word is state-smart 16:13:30 is there a reason for doing the state check before parsing? 16:13:35 tathi, no 16:13:47 : s" " state @ if $, then ; ' .self reclass 16:14:08 * crc was just typing it up quickly and didn't think about the order ahead of time 16:14:22 but that isnt how rf implements it? 16:14:40 ah, I was thinking you cut-and-pasted. 16:15:09 amca, RF only has a compile-time version of s" 16:15:19 : s" " $, ; ' .macro reclass 16:15:30 I see 16:15:53 any plans to give it both? 16:15:59 not in RF itself 16:16:04 in a module? 16:16:05 I will in the ans library 16:17:05 * amca nods 16:17:07 cool :) 16:17:17 --- part: amca left #forth 16:19:25 --- join: amca (n=plump@as-bri-3-118.ozonline.com.au) joined #forth 16:19:40 * amca rolls his eyes at himself 16:20:37 * crc updated the 8.3 tarball with the enhanced s" in modules/ans.forth 16:21:00 lol 16:21:02 cool 16:26:53 amca, I know huh :) 16:27:33 Raystm2: You know what? 16:27:50 crc: What is work? Is it a day job type thing? 16:27:53 your lol and cool what they were for. 16:28:33 are you not amazed at crc's speed of execution to fix the living retroforth language? 16:29:18 his /topic on his chat should read "RetroForth, You. Forth, The Machine named crc. " :) 16:29:37 lol 16:29:48 It's like a dang marathon watching him. 16:29:58 Raystm2: Oh, definately. He impresses me very much with his quick response 16:30:28 run crc run. never crash is my prayer! 16:30:37 lol 16:30:45 Made me think of Astroboy 16:30:49 hehe 16:30:54 i'm foody bye :) 16:31:17 foody bye? As in going away for food? 16:31:18 amca, I work 10-12 hours for denney electric supply (http://www.denneyelectricsupply.com) 16:31:26 Thats right 16:31:30 Do you enjoy it? 16:31:38 Work starts at 7-7:30am and ends at 5pm or later 16:31:46 I normally enjoy it 16:31:55 not today? 16:32:10 crc, what exactly do you do? 16:32:17 it was slow; slow days drag on forevery 16:32:22 Hi ho, hi ho, it's off to work I go. 16:32:22 I do a little bit of everything 16:32:43 cleaning, restock, shipping, receiving, taking orders, programming 16:32:43 ttfn 16:32:49 bye amca 16:32:53 --- quit: amca ("d34d") 16:33:18 --- join: OrngeTide (i=orange@rm-f.net) joined #forth 17:58:29 --- join: sproingie (n=chuck@64-121-2-59.c3-0.sfrn-ubr8.sfrn.ca.cable.rcn.com) joined #forth 18:35:50 --- quit: tathi ("leaving") 18:42:19 Hey all. 18:43:50 hi Quartus 18:50:19 How are things? 18:50:27 pretty good 18:50:30 :) 19:20:29 hi Quartus 19:21:34 Jeff Fox promissed to upload new colorforth, today, but he has yet to do it. I'm impatient. :) 20:13:30 New in what regard? 21:10:28 --- join: amca (n=plump@as-bri-4-1-14.ozonline.com.au) joined #forth 21:16:44 --- quit: amca ("d34d") 22:19:40 --- join: amca (n=plump@as-bri-3-25.ozonline.com.au) joined #forth 22:59:13 --- quit: swalters (Read error: 110 (Connection timed out)) 23:22:20 --- join: amca_ (n=plump@as-bri-3-221.ozonline.com.au) joined #forth 23:35:18 --- quit: sproingie (Connection timed out) 23:36:30 --- join: segher (n=segher@blueice2n1.de.ibm.com) joined #forth 23:36:32 --- quit: amca (Nick collision from services.) 23:36:38 --- nick: amca_ -> amca 23:38:15 --- join: amca_ (n=plump@as-bri-3-221.ozonline.com.au) joined #forth 23:38:28 --- quit: amca_ (Client Quit) 23:59:59 --- log: ended forth/05.12.06