02:07:13 -!- GregorR-L has quit ("Leaving"). 02:25:40 -!- kipple has quit (Read error: 110 (Connection timed out)). 04:29:34 YES!!!!!!!!!!!!!!!!!! 04:29:38 My boss saves the day! 04:29:47 I sent him a copy of the original 2L! 04:29:50 And he still has it 8-D 04:33:16 GAK! 04:33:19 I did misimplement it! 04:33:26 I KNEW it was supposed to be filled with 0s >_< 04:50:55 http://www.befunge.org/fyb/2l/HelloWorld.2l < Hello World in 2L :) 06:36:12 -!- lament has joined. 06:50:23 -!- calamari has joined. 07:14:59 -!- Keymaker has joined. 07:15:18 haha, that's probably coolest Hello World i've seen! 07:15:51 you should add it to that article in wikipedia that has hello world on different languages (including esoteric) :) 07:31:34 -!- calamari_ has joined. 07:40:07 I'll have to write a Wikipedia page for 2L as well... 07:40:15 ok 07:40:17 But I feel bad writing a page about my own language... 07:40:21 Like I'm advertizing myself... 07:40:34 hmm 07:40:39 i don't think so. 07:40:56 yeah, isn't there a rule against original research? 07:40:57 i mean i don't think it's advertizing :) 07:41:10 that's why we need the esowiki 07:41:21 there were rumors about deleting most of esoteric things from wikiperia. 07:41:31 seems like everyone to promises to put one up vanishes 07:42:03 they don't vanish, they just lose their mental health :p 07:42:12 and aren't able to write anymore 07:42:21 haha.. can't imagine a wiki being that hard to put up 07:42:22 thus we can't see them in irc 07:42:31 :) 07:42:49 Please do not create an article to promote yourself, a website, a product, or a business (see Wikipedia:What Wikipedia is not). 07:43:01 It's not really myself, a website, a product or a business. 07:43:04 So I guess it's OK 8-D 07:43:16 it's a product of your insanity ;) 07:43:32 hm. it isn't advertising in my humble opinion 07:44:43 I doubt anyone would care. just avoid using "I", "me", etc.. :) 07:45:31 How do you use a template... 07:45:57 don't ask me, just look some other entries "source code" 07:48:35 -!- calamari has quit (Read error: 110 (Connection timed out)). 07:48:55 -!- calamari_ has changed nick to calamari. 07:57:19 http://en.wikipedia.org/wiki/2L_programming_language 07:59:50 pretty good! 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:00:00 now make the traditional quine example :P 08:00:36 AHHHHHHHHHHHHHHHHHHHHHHHHHHHHH *head explodes* 08:00:42 hehe 08:01:01 actually it wouldn't be probably that complicated 08:01:06 or wait 08:01:09 it would 08:01:11 i guess :) 08:01:29 I'll try that sometime 08:01:44 when i first learn the basics 08:02:47 btw, so there's "infinite" space on right side? 08:03:48 Well, within the limits of the interpreter/compiler's memory 08:03:50 and the program ends if the pointer's x = -1 or y = -1 08:03:58 Yeah 08:04:00 yeah 08:04:01 ok! 08:04:06 thanks 08:04:10 See, it's not TOO bad 8-D 08:04:15 heh 08:25:23 are there two interpreters in the 2L package? 08:26:00 2lc.c and 2li.c? 08:26:14 which one i use? 08:29:26 and probably new-line is value 10 only (hopefully)? 08:35:26 and what's the file extension for 2l programs? 08:35:31 .2l ? 08:36:09 yay.. I'm now vapor.. http://lilly.csoft.net/~jeffryj/wiki/index.php 08:36:21 how long did that take.. 45 mins or so? 08:36:32 :) 08:36:56 Absolutely no content whatsoever 08:37:02 yeah 08:37:20 but didn't someone just recently start an esowiki? 08:37:23 I wonder.. should an esoteric wiki be well organized? =) 08:37:35 probably not :) 08:37:36 maybe.. but then I heard nothing 08:37:44 ok 08:37:54 not sure if the starter is here anymore 08:37:57 on this channel i mean 08:38:00 I haven't been here much, though.. so that means nothing :) 08:38:00 can't remember' 08:38:07 ya 08:38:26 I think the person was going to copy all the wikipedia content over 09:02:55 -!- Keymaker has quit (Read error: 110 (Connection timed out)). 09:08:45 -!- puzzlet has joined. 09:08:46 -!- puzzlet has quit (Remote closed the connection). 09:08:54 -!- puzzlet has joined. 10:45:29 hi 10:48:05 GregorR: are you around? 11:17:40 There was a good brainf*ck debugger somewhere? 11:18:01 I think mine is fairly good 11:18:45 looking for the damn link 11:20:19 http://perso.wanadoo.es/p.gimeno/files/brfd10.zip 11:20:51 Last night I wrote a 'regular expression to brainf*ck' compiler in java (parses a regular expression to a nondeterministic state automaton, determinizes and minimizes it, then writes brainf*ck code to "simulate" it) but the code generated is buggy. 11:21:14 whoa 11:21:19 * pgimeno rolls eyes 11:22:28 I think you can make use of that debugger, it has a couple of features that may be very helpful when debugging 11:27:53 Ooh, a "step out of current loop" feature is something I've really been looking forward to. :) 11:28:12 :) 11:28:43 is there a Library of BF Ready-Made Functions somewhere? you know, like you don't have to write the same routine again and again like, e.g. pcre in BF :) 11:33:19 -!- calamari_ has joined. 11:49:07 -!- calamari has quit (Read error: 110 (Connection timed out)). 11:52:32 -!- kipple has joined. 12:11:50 -!- calamari_ has quit ("Leaving"). 12:38:24 Yay. 12:38:29 fis@colin:~/prog/eclipse-workspace/misc$ java -cp . org.gehennom.misc.BFRE 'a(a|b)*b|b(a|b)*a' > ~/prog/misc/brfd/re.bf 12:38:35 fis@colin:~/prog/misc/brfd$ echo -n 'aabbab' | ./BRFD.EXE re.bf 12:38:35 acc! 12:38:35 fis@colin:~/prog/misc/brfd$ echo -n 'aabbaa' | ./BRFD.EXE re.bf 12:38:35 rej! 12:38:57 "This exhaustive testing conclusively proves it works for all regular expressions and inputs." 12:40:06 heh, nice! :) 12:40:31 -!- Keymaker has joined. 12:40:39 'ello 12:40:45 hi 12:40:48 hi 12:41:07 i don't think there's any brainfuck function collection 12:41:10 at least i haven't seen 12:41:58 that's sad 12:44:50 say, you want to operate with numbers > 255 (e.g. to perform a scientific computation; BF is soon to be implemented as the language of choice for scientific computations, replacing the now obsolete FORTRAN). Do you have to write your own bignum library? 12:46:21 yes :0 12:47:14 you can operate with really big numbers but it gets really hard 12:47:46 oh, well, it's up to the compiler to optimize the code so that it runs smoothly 12:49:36 if the code is slow, it's the compiler's fault 12:50:39 :) 12:50:47 hehe 12:51:10 is there a TPK algorithm implementation in BF? 12:51:16 what is that? 12:52:03 nope 12:52:12 as far as i know there is not 12:52:30 it's another kind of language features tester 12:52:42 would be pretty hard to code in bf i think 12:52:58 http://www.cs.fit.edu/~ryan/compare/ 12:53:17 yeah, i'm on that page righ now 12:53:29 Knuth has an Intercal version in his page 13:05:50 here's a befunge quine i made up today 13:05:53 "48*2+,>:#,_@ @_,#:>,+2*84 13:06:05 this method has been most probably used thousands of times, i have a feeling 13:08:16 I haven't ever befunged 13:08:35 well, i haven't much either 13:09:22 it looks deliciously simple 13:09:48 it is 13:12:18 I'll have a look when I have some spare time... right now I can't even dedicate to malbolge 13:12:27 ok 13:12:30 anyway stack-based languages are not among my favorites 13:12:40 i prefer tape :) 13:12:44 tape array 13:12:51 like brainfuck 13:12:57 indeed 13:13:07 i'm not such fan of stacks, probably because i have never used them before esolangs 13:13:29 I have written a bit of Forth but I didn't like it 13:13:39 that's probably why I don't like stacks 13:13:46 :) 13:13:52 I have to revisit Q-BAL sometime 13:15:52 i haven't tried that 13:16:01 and here's the second quine 13:16:02 ##"57*:,,48*2+,>:#,_48*2+,57*, @ ,*75,+2*84_,#:>,+2*84,,:*75"# 13:16:36 * pgimeno feels a symmetry pattern :P 13:16:49 Keymaker, brilliant! 13:17:07 :) cheers! 13:56:47 befunge has interesting stuff 13:56:52 such as self-replacement 13:57:14 the program can change its own code 14:38:55 I'm trying to debug my regexp compiler by looking at the state machines it creates. For something simple like that 'a(a|b)*b|b(a|b)*a' example it works, but for this date-with-time-validating regular expression the generated state machine is.. not very visualizable. You can look at http://gehennom.org/~fis/re.png for an example, but it's a 8422x6504-sized png so looking at it can be a bit sluggish. 14:39:06 I am having some trouble figuring out whether it is "correct" or not. :p 14:41:48 wow, so does some program do that picture? 14:41:55 i mean that your prog 14:42:49 Nope, I just dumped the transitions to a text file and mangled it a bit to create a .dot I feeded to graphviz. 14:43:42 I'm going to try combining the multiple transitions to a single arrow, now, the 10+ arrows going from a -> b aren't exactly helping. 14:44:20 ok 14:51:44 I agree, fizzie, I can't follow that graphic 14:52:36 looking at the original regex would help as well 14:52:49 It's.. messy. 14:54:04 My parser doesn't do character classes, so I had to convert [0-9] to (0|1|2|3|4|5|6|7|8|9). 14:57:16 -!- kipple has quit (Read error: 110 (Connection timed out)). 14:57:30 oh, the motivation of the difficulty... I think I could write a [x-y] range parser in a few minutes, but it's so easy that it's not worth spending time on it :P 15:05:45 Ahh. re2.png and especially re3.png are much clearer. In re2 the transitions have been combined, in re3 the "error state" has been left out. 15:08:40 The regular expression I used was '((0|1|2|_)(1|2|3|4|5|6|7|8|9)|3(0|1)).((0|_)(1|2|3|4|5|6|7|8|9)|1(0|1|2)).((0|1|2|3|4|5|6|7|8|9)(0|1|2|3|4|5|6|7|8|9)(0|1|2|3|4|5|6|7|8|9)(0|1|2|3|4|5|6|7|8|9)|_) *((0|1)(0|1|2|3|4|5|6|7|8|9)|2(0|1|2|3)):(0|1|2|3|4|5)(0|1|2|3|4|5|6|7|8|9)(:(0|1|2|3|4|5)(0|1|2|3|4|5|6|7|8|9)|:6(0|1)|_)' 15:09:08 (There's a " *" between the parts, that's perhaps not very clear if it line-wraps badly.) 15:09:44 But as far as I can determine, the automaton is correct, so my brainf*ck code is not. Bleh. 15:10:23 That's not _really_ a date-validating regexp, since it doesn't care about number of days in a month. 15:10:37 (It does allow leap seconds, though.) 15:10:43 what kind of brainfuck code you got? 15:11:45 That's in http://gehennom.org/~fis/re.bf.txt .. it's not very optimized. :p 15:12:06 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAARRRRRGH! 15:12:10 :D 15:12:19 maybe i won't try looking what could be wrong.. 15:12:39 woah.. 15:13:13 You can look at re2.bf.txt if you want, that's commented. 15:13:19 sure 15:13:22 Automatically commented, even. :p 15:15:55 I guess I'll try debugging it when I have some free time. :p 15:16:12 Single-stepping and watching the state transitions helps to see where it goes worng. 15:35:45 fis@colin:~/prog/misc/brfd$ echo -n '11.4.2002 11:03:22' | ./BRFD.EXE re.bf 15:35:45 acc! 15:35:45 fis@colin:~/prog/misc/brfd$ echo -n '32.4.2002 11:03:22' | ./BRFD.EXE re.bf 15:35:45 rej! 15:35:45 fis@colin:~/prog/misc/brfd$ echo -n '11.4.2002 11:60:22' | ./BRFD.EXE re.bf 15:35:47 rej! 15:36:22 There was a simple bug in the few last lines of brainf*ck where it chose what to print. 15:36:50 hm, according to the graph you can't type 10.x.xxxx 15:38:19 or 20.x.xxxx 15:42:18 -!- kipple has joined. 15:45:38 Oh, right. 15:45:43 That's a bug in the regexp, though. 15:46:27 ((0|1|2|_)(1|2|3|4|5|6|7|8|9)|3(0|1)) should be something like ((0|1|2_)(1|2|3|4|5|6|7|8|9)|(1|2)0|3(0|1)) 15:47:21 does * have the classical meaning? 15:47:36 what's _? 15:47:44 epsilon i assume 15:47:46 _ is the empty string, yes. 15:47:57 oh 15:48:13 uh, which is actually different from epsilon, isn't it? i'm getting confused by the terminology 15:48:44 I'm used to the (0|1|2)? kind of test 15:49:27 This doesn't have "?". The syntax is straight from our "Introduction to Theoretical Computer Science" course homework assignment checker. 15:50:31 I haven't read that, I'm just an egrep user :) 16:14:32 Keymaker: 2li.c is an interpreter, 2lc.c is a compiler. 16:14:38 pgimeno: You buzzed? 16:14:51 ah ok 16:14:53 :) 16:17:56 Oh, and, yeah, .2. 16:17:59 *.2l 16:24:49 ok 16:25:53 attention! 16:26:16 if you want to check out my programming site i just made the way i want it to be, go here: 16:26:17 http://koti.mbnet.fi/yiap/ 16:26:22 not much content yet 16:26:37 but i hope to add programs there as time passes 16:26:53 as well, tell me what do you think about the "design" 16:27:29 Gregor is incapable of design decisions. 16:27:31 Trust me 16:27:50 However, I notice a distinctive lack of 2L quines :-P 16:28:13 :) 16:28:49 is 2l turing-complete? 16:29:33 I'm almost positive it is - I'm modestly sure that it's BF-complete. 16:29:59 Any BF operation could be done with a bit of blood sweat and tears. 16:30:12 GregorR: hey 16:30:22 pgimeno: Hey 16:30:23 :) 16:30:43 this channel hasn't been this active for a very long time 16:30:54 Heheh 16:30:56 (so good you two joined :)) 16:32:01 GregorR: well, about hosting 2L 16:32:50 I can give you a permanent page (not very intuitive but at least immutable in some years) 16:33:21 How so? 16:33:28 IE: How is it "not very intuitive"? 16:33:39 Unlike 2L, which is mind-blowingly intuitive :-P 16:33:46 something like http://www.formauri.es/personal/GregorR/ 16:33:49 hehe 16:34:07 I could supply a subdomain. 16:34:27 I own codu.org , but have very minimal space and bandwidth on my host there :-P 16:34:29 this damn hosting company doesn't allow subdomains 16:34:32 Because I pay $1/mo 8-D 16:34:44 I can set up a redirection 16:34:55 oops, sorry, work 16:34:55 Well, I meant a redirection from 2l.codu.org 16:34:59 brb 16:35:17 "Whoops, got to make my boss look like I'm doing work" ? 16:37:22 hehe 16:38:08 well, as you like 16:38:31 Anyway, yeah, that'd be great 16:39:08 I'd just want to avoid it being lost like so many others 16:39:40 I'm afraid of the day web.archive.org is down 16:40:04 yeah. I''ve been thinking about that too. 16:40:15 too many esolangs exist on only one webpage 16:40:31 Are there any OO esoteric languages (other than Java of course ahaha) 16:40:49 Java2K? 16:41:02 is that OO? I don't think so 16:41:10 just a random thought 16:41:15 well, of course HQ9++ 16:41:27 too bad it's not turing-complete 16:41:38 hehe 16:41:56 Remember that ugly re.bf.txt? I quick-n-dirty-converted it to befunge: http://gehennom.org/~fis/re.bef.txt - I don't have any befunge interpreter here that'd support unlimited-size playfield and [a-f] hex-numbers, so I haven't tested it. 16:42:41 wow 16:44:08 About the only optimization it does it to combine runs of +++s, ---s, <<>>s into a single 2f*4+f*1+ -style number. Other than that, it's a straight translation of the brainf*ck code. 16:44:25 (Except that loops involve a lot of going-around.) 16:46:34 It's amazing how many diversions one can find when the other alternative would be to read for exams. ('Fundamentals of network media' and 'Discrete Mathematics' both are tomorrow.) 16:46:47 :) 16:46:51 yeah, i know that.. 16:47:13 (i mean i know that allkinds of other stuff can be done easily instead of reading to exams.) 16:47:31 Sometime this week, I will have an esoteric OO programming language ... because the world needs one (other than Java ahaha) 16:49:20 great :) 16:49:38 :) 16:50:15 so, what OO concepts are you planning to include? 16:51:52 Well, just one sec. Does anybody agree that this would be esoteric (this will be a few lines...): 16:51:57 There is such a thing as a voicebox. 16:51:57 A voicebox can speak a word. 16:51:57 When this program starts: 16:51:57 I have one voicebox. 16:51:57 My first voicebox speaks "Hello World!" 16:51:58 When a voicebox is to speak: 16:52:00 I have one stdout. 16:52:02 My first stdout is to speak the word. 16:52:49 Inheritance wouldn't be too hard, and I have a plan for class variables ... no public/private interfaces. 16:53:18 Whoops, gtg to school. 16:53:23 See you all later. 16:53:30 later GregorR 16:53:39 fizzie, you're currently hosting GregorR's 2L, right? 16:53:54 bye 17:20:23 rghh 17:21:43 must go. 17:21:48 later' 17:21:49 -!- Keymaker has quit ("Freedom!"). 17:47:34 Yeah, fizzie is 17:47:58 The more I think of it, the more I think that that wouldn't be esoteric enough. 17:48:07 It's sort of pointlessly wordy, but way too intuitive. 17:56:31 well, I like it and that's enough :) 17:56:38 (for me anyway) 17:56:54 X-D 17:57:19 some notes about the Wikipedia article 17:58:05 an example should not be so long 17:58:15 I think it's 4-5 lines 17:59:11 I don't know if I can accomplish anything in less X-D 17:59:16 -!- GregorR-L has joined. 18:00:08 I mean the line limit 18:01:50 would you allow me to make small edits here and there to let it conform to the Wikipedia policies better? 18:03:44 Ohhhhhhh 18:03:45 Sure 18:04:38 the "Hello world" can't be there, would you mind if I take the example from the tutorial? 18:04:51 Sure 18:04:58 It's even more worthless, but yeah :-P 18:06:00 it's just for the casual user to get an idea of what a program looks like 18:06:43 Heh, I guess so 18:06:49 And to scare them away >:) 18:09:00 YAY! 5 midterms in this series and I've gotten an A on every single one 8-D 18:12:18 wow, congrats! 18:12:50 btw, it's done: http://en.wikipedia.org/wiki/2L_programming_language 18:13:24 Hoopla :) 18:15:08 damn, "Server shutdown in progress" 18:15:26 Byeeeeeeeeeeeeeeee :-P 18:23:12 I guess that those who want to see what "Hello, world!" looks like will have to visit the page 18:23:39 oh, as soon as you want me to post it, tell me what the files are and I'll post them 18:32:14 bbl 18:46:05 Wow, that Hello World looks great :) 18:46:43 really nice (read: nasty) language... 19:07:15 Wow 19:10:21 And what's "<" in the sample program in Wikipedia? 19:11:28 From the spec: "The < is the direction that your program pointer will be going in when you're done producing the 19:11:28 value." 19:11:44 got me confused for a while as well 19:12:32 YAY! 19:12:33 i changed "(0,0) moving down" with "(0,0) moving right" 19:12:59 It's actually supposed to be "moving down" 19:13:07 My old README was screwy... 19:13:14 Because I was working from memory 19:13:25 Anyway, back to "YAY!" 19:13:32 My OO esoteric language is functional :-P 19:13:53 ok 19:14:08 that's nice. Care to show us? 19:15:07 Give me a bit. 19:15:14 Well, I could paste something in here... 19:15:19 But I'm still working on the spec. 19:15:24 I've started thinking about one myself :) 19:16:03 http://pastebin.ca/11055 19:16:28 -!- cmeme has quit (Read error: 131 (Connection reset by peer)). 19:17:31 -!- cmeme has joined. 19:17:50 -!- cmeme has quit (Remote closed the connection). 19:18:33 -!- cmeme has joined. 19:18:41 is that actual code? 19:18:58 Yes. 19:19:02 It's also a story X-D 19:19:53 omg 19:20:05 that's awesome 19:20:13 :-P 19:20:35 It has the usefulness of BASIC with the power of English and OO! 19:21:29 There's no logic yet. 19:21:32 So I'm not done :-P 19:22:45 so, outputter is the only pre-defined object in that code. Am I right? 19:22:52 Yeah 19:23:03 I'm also going to make mathematician 19:23:13 I have a mathematician called ProfessorBob 19:23:22 ProfessorBob is to increment myNumber. 19:23:24 :) 19:50:04 that program sounds like some kind of weird poetry 19:50:46 kind of like a childrens book :) 20:02:01 that kind of thing gets very old very fast 20:07:06 -!- GregorR-L has quit (Read error: 113 (No route to host)). 21:26:31 Well. ORK (this OO esoteric language) turns out to be the source of all evil in this world. 21:26:36 However, it is now working. 21:26:46 However however, I'm at work and can't send it up anywhere :( 21:27:07 ORK = Objekts R Kool 21:38:13 -!- Keymaker has joined. 21:38:14 hi 21:38:23 Hoi 21:38:29 :) 21:38:31 (I'm not here, I'm at work ;) ) 21:39:20 heh 21:39:47 So I'll upload my esoteric OO language somewhere this evening (when I'm not at work) 21:39:52 But here's a sample: 21:40:08 This sample will multiply 5 by 5 then output the result 21:40:14 When this program begins: 21:40:21 There is a mathematician called ProfBob. 21:40:29 There is an outputter called StdOut. 21:40:34 ProfBob's first operand is 5. 21:40:40 ProfBob's second operand is 5. 21:40:44 ProfBob is to multiply. 21:40:53 StdOut is to output ProfBob's result. 21:41:30 lol 21:41:34 looks nice 21:41:56 And it's object oriented beyond all usefulness :-P 21:55:04 must.. invent.. own.. esoteric.. language.. 21:55:17 * Keymaker tries to think 21:56:12 can't get any connect to brains :p 21:56:22 *connection 22:01:41 I think I'm about done creating them ... 22:01:52 I've created a too-little-to-work-with-a-la-BF one... 22:02:01 I've created a too-damn-wordy-to-be-useful one... 22:02:06 :) 22:02:21 But one of these days, I'll go "You know what would be totally worthless..." 22:29:34 I think I want a befunge variant with function calls (simple define-function-with-integer-name, call-function-n and return would suffice, although I'm not sure if there should be a way of having more than a single return value) and perhaps with a _really_ simple module system (load-a-file, which could export a set of functions). 22:29:53 I guess it'd be cheatey and unbefungey, but that'd be a language one could actually use for real-world applications. 22:30:58 I would LOVE to see a non-esoteric 2D language. 22:31:08 yeah 22:31:15 would pretty cool 22:31:56 My attempts to conceptualize one have all been in vain, however :( 22:42:45 damn, I've been too busy tonight and I must leave now... I'll read the backlog tomorrow, bye 22:49:50 bye 22:50:09 i'm too tired to do anything, i'll go too 22:50:14 good night 22:50:18 -!- Keymaker has quit ("Freedom!"). 23:56:48 I made a quaint little 60-line recursive Fibonacci number generator in ORK :-P 23:57:05 It would have taken, oh, maybe as many as 10 in C++.