00:04:48 -!- calamari has joined. 00:05:03 hi 00:05:38 <{^Raven^}> ferralDude 00:05:51 <{^Raven^}> oops, wrong room 00:06:54 <{^Raven^}> hi 00:07:14 re Raven :) 00:07:35 GregorR: you can save yourself a lot of time by copying the algorithms from bfbasic 00:07:48 for +-*/ etc 00:07:57 arrays 00:08:28 -!- GregorR-L has quit (Read error: 113 (No route to host)). 00:08:50 or you can have your irc client die and read the logs ;) 00:09:23 * {^Raven^} chuckles 00:10:03 <{^Raven^}> There are a lot of techniques in bfbasic that should be useful 00:13:15 yep, and it's GPL 00:13:45 I think I improved the array algorithms in the CVS version 00:13:52 at some point 00:15:18 can't seem to access the cvs from school tho 00:21:58 -!- NoneGiven has joined. 00:22:08 another problem is that we are parsing inside the statement code 00:22:41 that was tricky to figure out 00:22:51 * NoneGiven is {^Raven^} 00:22:57 hopefully that will change to everything being parsed beforehand and dealing with patterns 00:23:48 if you want to kill {^Raven^} you can tell nickserv 00:24:15 /msg nickserv help ghost 00:26:52 -!- Sgeo has quit. 00:27:41 The SELECT structure was simple once i twigged the parser 00:28:18 it took me ages to figure out how to parse FOR .. STEP 00:31:13 calamari: Much of BFBASIC is written like an interpreter 00:32:22 * NoneGiven is off to bed (and time out) 00:32:27 cya :) 00:32:31 byeee 00:33:07 I wanted the ability to use Basic to do things like BEEP = PRINT CHR$(7); 00:33:19 without having to duplicate effort of PRINT or CHR$() 00:34:03 so when it sees BEEP it just adds PRINT CHR$(7); and parses that next 00:34:41 much of the compiler depends on that behaviour 00:34:46 yep 00:34:59 most conditionals.. DO/WHILE, FOR, ELSE 00:35:24 perhaps there is a better way 00:35:48 anyhow, don't want to keep ya 00:36:15 there should be a better way, but the current system seems to work very well 00:36:28 * NoneGiven falls asleep 01:31:10 bbl 01:31:12 -!- calamari has quit ("Leaving"). 01:49:59 -!- {^Raven^} has quit (Read error: 110 (Connection timed out)). 02:04:31 -!- GregorR-L has joined. 02:05:47 *yawn* 02:05:50 Good ol' logs 02:15:35 Hmmm ...... 02:15:43 I don't know that the array algorithm would be very useful. 02:15:48 Because of how arrays work in C. 02:15:53 Arrays are just pointers to buffers ... 02:16:07 So it's all pointer arithmetic. 02:24:40 "So there you have it: a proof that that statement is indeed improvably true." 02:25:02 lol 02:25:15 "This statement is true." 02:25:19 Please prove that that statement is true. 02:25:23 With a formal proof. 02:26:56 Suppose the statement is false. End scope. Suppose the statement is true. End scope. 02:27:13 Oh, wait. 02:27:53 Heh. 02:27:58 Suppose we have the axiom "This statement is true." with no production rules. We have just proven it. 02:31:55 Oops, I scratched some... stuff off this sticker thingy. 02:32:12 Now I have a 16 GHz laptop because I scratched off the decimal point. 02:33:38 lol 02:33:42 That's one fast laptop. 02:34:19 It'll be very slow in a while. 02:34:32 You know... processors slow down after a while. 02:34:32 Drawing a . before the 1? :) 02:34:39 Yes, indubidably. 02:34:56 People have to keep changing the spec so a processor will always measure the same. 02:35:07 lol 02:36:03 Either that, or game programmers slowly start making games that work slower and slower. 02:36:18 Uh oh, he's on to the real secret! 02:36:28 * GregorR-L calls the Gamer Subversion Squad 02:36:32 In that case, we could just fire them all and hire some new--- 02:36:39 Oops. I said too much. 02:36:52 I DIDN'T MEAN TO UNDERMINE THE HARDWARE INDUSTRY, HONEST! 02:37:07 Speaking of subversion ... 02:37:14 I need a subversion repository for C2BF :P 02:37:45 Well, I have to go. 02:37:56 9:37. Bedtime's at 9:00... 02:37:57 Byeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee. 02:38:00 Ouch 02:38:06 I hope you mean AM X-P 02:38:12 ...So why the rush? I have about 11 hours to go! 02:38:46 So... 02:39:03 * ihope adds more dots to that ellipsis 02:39:09 So bye :P 02:39:15 Wait, wait. 02:39:26 Let's start over, in a while... 02:39:40 Oops! 02:39:55 Oh, never mind. 02:40:12 "By" ++ repeat 'e' ++ "!" 02:40:31 Bye+\! 02:59:45 -!- ihope has quit (Read error: 110 (Connection timed out)). 03:47:56 -!- kipple_ has quit (Read error: 110 (Connection timed out)). 04:04:03 -!- GregorR-L has quit (Read error: 113 (No route to host)). 06:19:05 -!- CXII has joined. 06:20:48 -!- CXI has quit (Nick collision from services.). 06:20:49 -!- CXII has changed nick to CXI. 07:06:10 -!- Freya has joined. 07:33:19 -!- tokigun has quit (kornbluth.freenode.net irc.freenode.net). 07:33:20 -!- sp3tt_ has quit (kornbluth.freenode.net irc.freenode.net). 07:33:20 -!- sekhmet has quit (kornbluth.freenode.net irc.freenode.net). 07:33:41 -!- tokigun has joined. 07:33:41 -!- sp3tt_ has joined. 07:33:41 -!- sekhmet has joined. 07:59:59 -!- clog has quit (ended). 08:01:37 -!- clog has joined. 08:01:37 -!- Freya has quit (Read error: 104 (Connection reset by peer)). 08:03:10 -!- clog has quit (^C). 08:03:10 -!- clog has quit (ended). 08:03:25 -!- clog has joined. 08:03:25 -!- clog has joined. 09:28:40 -!- nooga has joined. 09:28:44 hi 09:42:02 anybody here? :P 09:45:23 huh 09:50:57 -!- nooga has quit (Read error: 110 (Connection timed out)). 10:48:59 -!- CXII has joined. 11:03:08 -!- CXI has quit (Read error: 110 (Connection timed out)). 14:01:37 -!- jix has joined. 14:38:25 -!- nooga has joined. 14:39:39 hi 14:40:02 jix, did u use Parsec for writing Rhotor interpreter? 14:42:49 no 14:43:01 i wrote the parser myself 14:47:53 good lord 14:48:35 haskell seems very nice for writing interpreters 14:51:00 why didn't u used Parsec? 14:51:06 it looks nice 14:52:23 because my syntax is complex and it would have taken more time to learn all the parsec syntax 14:53:07 complex? 14:53:15 naah 14:54:05 jix, can i tell u something? 14:55:50 well it is complex enough to make it easier to implement a custom parser than compiling and learning parsec 14:56:21 no it isn't complex enough but it has the right degree of complexity if it would be a lot more complex i'd have taken parsec 14:56:25 nooga: yes 14:57:10 sure, haskell is better for parsing than C+yacc as is 14:57:22 ruby+racc is very nice too 14:57:30 but you don't want to do string handling at all in c 14:57:57 jix: when i talk with you i feel like i was talking with HAL 14:58:12 LOL 15:00:43 you know, no emotes, no stupid jokes, just pure, exact sentences 15:01:43 -!- ihope has joined. 15:02:01 hi ihope 15:02:05 Hello 15:02:26 I'm writing a spec for another new language, Minks. 15:05:04 oh 15:05:07 cool, show us :D 15:05:43 jix: i didn't intend to offend you 15:06:24 nooga: you didn't 15:06:31 i was just afk 15:06:34 Hmm. /me quits the posting on the comment thingies and gets to work 15:07:17 Problem: I can't decide whether this is a joke language or not. 15:07:49 Oh, right. I was looking up the Turing-completeness proof for Minsky machines... 15:11:01 -!- kipple has joined. 15:26:28 !help 15:26:42 ...Right, right. 15:33:18 ihope: so what's this Minks language about? 15:34:24 Minsky machines. 15:34:45 A.k.a. register machines, a.k.a. program machines... 15:35:27 Eh, I'll finish it later 15:35:33 * ihope runs off 15:43:47 one register? 15:54:16 hm 15:54:51 * nooga loves ruby & haskell 16:15:25 jix: two... 16:17:01 Is it just me, or is Minks not showing up on the Recent Changes? 16:17:18 s/C/c/ :-P 16:18:34 huh? in the wiki you mean? 16:18:41 Aye. 16:18:58 it doesn't show, but there is no Minks article either 16:19:02 ihope: why two? 16:19:05 why not one 16:19:11 One's not enough! 16:19:15 it is 16:19:27 if you use multiplication division instead of addition and subtraction 16:19:52 But maybe addition and subtraction is harder to use. 16:20:00 it is 16:20:15 Less obvious, anyway. 16:20:28 multiplication and division using one register is like addition and subtraction on as many registers as you want 16:21:07 have you entered a Minks article in the wiki? I can't find it... 16:21:31 Apparently I clicked the wrong button, and it previewed itstead of saving. 16:26:30 Now thw spec's up. 16:34:54 "Rough-coated, dough-faced, thoughtful ploughman John Gough strode through the streets of Scarborough; after falling into a slough on Coughlin road near the lough (dry due to drought), he coughed and hiccoughed, then checked his horse's houghs and washed up in a trough!" 16:41:59 tumtetum 16:42:13 -!- nooga has quit (No route to host). 16:43:46 There once was a lady from Slough / Who caught a terrible cough / She wasn't to know / It would last until now / So let's hope that she will pull through. 16:48:34 -!- nooga has joined. 16:48:45 l 16:50:32 1? l? I? 16:51:13 ? 16:51:30 ah, i was typing "haskell" when windiw appeared 16:51:33 window 16:52:16 :-) 16:55:10 how's your language? 16:56:16 Um, http://esoteric.voxelperfect.net/wiki/Minks 16:59:24 ihope: not turing complete 16:59:29 oh 16:59:30 wait 16:59:41 didn't read one line in the spec 16:59:53 jix: you can assess turing completenes by just starring at the doc? 17:00:07 i just saw the list of commands 17:00:17 and there were no looping or jumping commands 17:00:25 youre chuck norris or something 17:01:50 Hmm, /away-ness 17:05:44 -!- NoneGiven has changed nick to {^Raven^}. 17:08:59 INP: takes input and puts it in the REGISTER. 17:08:59 inp: takes input and puts it in the REGISTER. 17:09:03 is that correct? 17:11:33 i think it isn't 17:17:49 me too 17:23:54 corrected 17:44:21 bye 17:44:23 -!- nooga has quit. 18:29:24 -!- CXI has joined. 18:42:20 -!- nooga has joined. 18:42:25 . 18:51:41 -!- CXII has quit (Connection timed out). 18:54:58 -!- GregorR has joined. 18:56:17 -!- EgoBot has joined. 18:56:36 hi GregorR and his pet 18:58:38 'ello nooga. 18:58:46 My building finally got the network working again. 18:58:49 At blazing dialup speeds. 18:59:29 lol 18:59:45 dialup, i heard that dialup in US is good way to connect 18:59:59 here in Poland we've all have cable 19:00:15 bcs dialup is horribly EXPENSIVE 19:00:59 Hah 19:03:24 so 19:03:29 how's c2bf going? 19:03:49 Still working on this damn AST. 19:03:55 It's such a mechanical process >_< 19:04:14 Oh, and I'm up to 10 pages on c2bf.pdf. 19:04:19 As soon as I upload it. 19:04:22 At BLAZING DIALUP SPEEDS. 19:04:42 well 19:07:25 Then once the AST is done, I'll generate the generator with unimplemented stubs, and start filling it in to support one basic program. Then I'll have a proof of concept. 19:07:46 mhm 19:07:55 damn.... got to go 19:08:00 b y e 19:08:05 Bye :P 19:08:12 -!- nooga has quit. 19:44:38 Hmm, /back-ness 19:44:55 So what's the verdict? Turing-complete? 19:45:14 (And thanks for correcting that mistake.) 20:08:28 New color-coding for languages. Spanish is red, French is blue, German is brown, Italian is green, and English is black. 20:18:55 -!- calamari has joined. 20:19:07 hi 20:28:45 Ello 20:29:07 hi ihope 20:56:55 -!- Sgeo has joined. 21:33:22 -!- sp3tt has joined. 21:34:45 -!- sp3tt has left (?). 22:22:17 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 22:24:27 Syntax-highlighted befunge is my favourite art form. 22:24:35 :-) 22:25:31 I am only aware of two pieces of it, though. 22:27:01 Heh. 22:28:58 (There's mooz's infamous quicksort at http://kotisivu.mtv3.fi/quux/qsort.html and my Turing machine interpreter at http://gehennom.org/~fis/utm.html - any other?) 22:32:08 I want a language that consists entirely of syntax highlighting. 22:32:48 Those pieces of syntax-highlighted befunge do look a bit like Piet code. 22:43:14 Piet... Piet... wasn't there some guy named Piet once> 22:51:27 I wonder what those guys were thinking when they wrote "you have no chance to survive make your time"... 23:12:12 -!- ihope has quit ("Chatzilla 0.9.69.1 [Firefox 1.5/2005111116]").