00:02:56 -!- ehird` has quit. 00:04:32 -!- RodgerTheGreat has joined. 00:04:34 howdy, folks 00:06:06 Ello. 00:06:25 hey, ihope 00:11:36 hello.jpg 00:11:58 sick fucker 00:13:47 *cough* 00:14:42 maybe it is funnier on bash 00:15:59 yeah, usually is 00:22:29 * pikhq returneth 00:22:46 wb, pikhq 00:32:34 -!- sebbu has quit ("@+"). 01:09:48 -!- oerjan has quit ("Good night"). 01:25:27 "hfs" 01:25:47 HFS? 01:25:49 Or hfs? 01:27:34 "HFs"? 01:27:45 http://www.openbsd.org/cgi-bin/cvsweb/src/usr.bin/sed/TEST/math.sed 01:28:16 makes me want to learn more sed 01:29:05 * SimonRC wonders where th sokoban in sed got to 01:29:51 and there is a nearly-full dc written in sed 01:29:53 there's also 4-tower hanoi in that directory 01:29:57 O.o 01:29:59 that's awesome 01:32:09 sed in dc would be cooler 01:32:16 but i don't think it can be done 01:32:36 hmm 01:32:44 dc lacks a "drop2 command 01:32:48 but apart from that... 01:32:53 *"drop" 01:32:57 no, it has one 01:33:31 what? 01:33:32 "n". 01:33:44 Zd Removes an item from the stack and outputs it without a newline. 01:34:04 (why no newline is beyond me) 01:34:21 So that you can have no newline? 01:34:30 yeah... 01:34:39 it's easy to add a newline, hard to take away one 01:36:00 Ooh! Maybe I'll slightly revamp my parser language and call it "Cetacea". 01:39:41 oooh, i think sed could actually be implemented in dc 01:39:55 by storing strings as lists of numbers instead of the builtin strings 01:41:02 Of *course* sed could be implemented in dc. 01:41:12 At least, GNU dc is Turing complete. . . 01:41:49 all dc are turing complete 01:42:57 Not necessarily. 01:43:07 dc even has 128 tapes and an extra stack, so it's 128.5 times more powerful than a turing machine!! 01:43:17 how not necessarily? 01:43:29 A simple dc is merely a push-down automaton. 01:43:56 no 01:45:46 dc as defined in dc(1) all the way back in 1965 01:45:52 Ah. 01:46:42 Could you find said man page? 01:47:09 http://plan9.bell-labs.com/7thEdMan/vol2/dc 01:50:25 zzzzzzzz 02:02:53 Clearly SimonRC is BORED by dc. 02:02:55 What a jerk. 02:03:51 bored by dc??!??! 02:03:58 dc is like my favorite language ever 02:37:52 i always got confused about why there's both dc and bc 02:37:56 and as a result, learned neither. 02:43:42 -!- puzzlet has quit (Client Quit). 02:51:38 -!- puzzlet has joined. 02:52:08 -!- puzzlet has quit (Client Quit). 02:58:32 -!- puzzlet has joined. 03:02:44 -!- puzzlet has quit (Client Quit). 03:04:09 -!- puzzlet has joined. 03:17:37 lament: Traditionally, dc was an RPN calculator, and bc was an infix frontend for the same. 03:17:40 lament dc belongs in #esoteric, bc not 03:17:55 In GNU, they're just different programs in coreutils. 03:18:04 bc compiles to dc 03:18:17 bsmntbombdood: GNU's implementation doesn't. 03:18:39 bc also has silly things like functions, variables, and structured loops 03:19:07 "It is not implemented in the traditional way using 'dc'." -- bc.info 03:19:14 ok 03:19:28 . . . It has a bytecode compiler?!? 03:19:41 Seems a bit overdone for a comparatively simple program. 03:20:19 openbsd's bc is written in yacc 03:20:31 A whole compiler can't be done in Yacc. 03:21:13 depends where you think yacc ends 03:21:15 Although it may *use* Yacc to parse, as I imagine GNU bc does. . . 03:21:23 The moment you start using stuff in Flex. ;) 03:21:47 openbsd bc uses lex too 03:22:32 but lex is pretty insignificant compared to yacc 03:23:16 and yacc can't be used without writing the actions in C, so nothing can be strictly completely written in yacc 03:24:09 And since Yacc is a *parser generator*, even if you could, it'd not actually get any compilation done. 03:24:32 huh? 03:25:25 Yacc only generates a parser. . . 03:25:52 That's not all that's in a compiler. 03:26:10 You neglect this funny thing called "code generation". 03:26:10 the parser doesn't need to be sepperate from the code generator 03:26:17 It is with yacc. . . 03:26:21 no... 03:26:22 (last I checked) 03:27:10 yacc doesn't make a parse tree for you 03:39:22 * pikhq decides to learn Yacc 03:39:44 I don't understand the advantage to yacc at all in comparison with writing the parser by hand- parsing isn't one of the difficult aspects of writing a compiler at all 03:40:29 I suppose it could *become* useful with arbitrarily complex grammars, but you'd have something hideous by the time you hit the break even point, I think. 03:41:21 *cough* C *cough* 03:41:31 case in point 03:42:08 parsers are hard 03:42:34 what *about* parsers are hard? 03:43:48 the parsing 03:45:49 tokenization is straightforward, relying primarily on defining patterns that determine certain types of tokens and scanning forward, with some minor exceptions for nesting. Building parse trees is basically just error-checking and order of operations. 03:50:19 there are a lot of aspects of compiler design and implementation that are really difficult (especially when the language doesn't help), but I really can't find anything in parsing that can hold a candle to the other stuff. 03:53:01 Realise that I wrote a compiler without knowing how to do a parser. ;) 03:54:33 pikhq: that's my point exactly- it's more or less trivial 03:55:16 if an average hacker can reinvent something without undue difficulty, it's trivial. 03:55:50 RodgerTheGreat: No, I mean "I didn't even do a parser". 03:56:04 My "parser" in PEBBLE is Tcl's source command. 03:56:10 lol 03:56:22 brilliant 03:56:34 One must admit, it works pretty well. 03:57:45 int c = getchar (); 03:58:00 Out of *immense* curiosity, how could that involve an invalid lvalue? 03:58:46 hm 04:05:21 pikhq: because your compiler is expressing its displeasure at your use of spaces 04:05:56 that is an unusual way to apply whitespace to a function call 04:06:28 Sorry; that's the GNU indentation standard; kinda start thinking in it when I start flipping through GNU manuals. 04:06:50 gnu couldn't possible request spacing like that 04:07:17 http://en.wikipedia.org/wiki/GNU_coding_standards 04:07:19 I'm gonna have to side with bsmntbombdood with this one 04:07:57 christ, that's like a laundry list of all the coding style points I have distaste for 04:08:22 the two-space-bracket-two-space thing is annoying 04:08:36 spaces-as-tabs, spaces before function parameter blocks, /* oneliner comments like this */ 04:09:11 bsmntbombdood: yeah- wtf? 04:09:14 what's wrong with the comments? 04:09:26 well, actually, I'll retract that one 04:09:50 // comments should always be used for oneliners, but if I recall, ANSI C lacks those. 04:10:09 you recall correctly 04:10:20 *Modern* ANSI C has it; GNU tries to maintain some level of backwards compatibility with older standards and K&R C. 04:10:35 C99 has the C++ style i think 04:10:45 not C89 04:10:48 * pikhq nods 04:11:17 but yes, that indentation style causes me great pain. 04:14:43 http://pastebin.ca/693143 <--- my way 04:16:42 arrgh, s/while (/while(/ and s/strcmp (/strcmp(/ 04:16:57 hm 04:18:25 different prog, but I think this code represents my coding style pretty well: http://nonlogic.org/dump/text/1189566634.html 04:19:31 that's not C!111123 04:20:12 bitch, bitch, moan, moan 04:22:15 all curly-bracket languages are equal when it comes to coding style. 04:54:23 * pikhq has done his first program via Yacc & Flex. . . 05:16:15 {} {} {} {} {} {} {} 05:16:24 {} {} {} {} {} {} 05:16:32 {} {} {} {} {} {} 05:16:42 ^-- a sample program in a curly-bracket language 05:17:25 -!- poiuy_qwert has quit (Read error: 104 (Connection reset by peer)). 05:20:33 LMAO 05:35:25 -!- fizzie has quit (Read error: 54 (Connection reset by peer)). 07:09:56 -!- sebbu has joined. 07:22:20 -!- pikhq has quit (Read error: 110 (Connection timed out)). 07:29:56 []{} 07:29:58 []{}[] 07:30:00 {}[] 07:30:07 [][][][][][][] 07:30:10 [][][][][][] 07:30:11 [][][][][][][] 07:30:13 [][][][][][] 07:30:14 [][][][][][][] 07:30:17 [][][][][][] 07:30:29 [][][][][][][] 07:30:33 pink floyd the wall 07:42:34 -!- pikhq has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:21:50 -!- pikhq has quit (Read error: 104 (Connection reset by peer)). 08:22:37 -!- pikhq has joined. 09:01:43 -!- RedDak has joined. 09:31:22 -!- SEO_DUDE has quit (Remote closed the connection). 09:40:33 -!- SEO_DUDE has joined. 11:24:19 -!- ehird` has joined. 11:25:34 -!- ehird` has quit (Client Quit). 11:41:08 -!- RodgerTheGreat has quit (Read error: 110 (Connection timed out)). 11:47:51 -!- RodgerTheGreat has joined. 11:56:39 -!- ehird`_ has joined. 12:05:48 -!- SEO_DUDE has quit ("using sirc version 2.211"). 12:07:16 -!- RodgerTheGreat has quit (Read error: 110 (Connection timed out)). 12:07:42 -!- RodgerTheGreat has joined. 12:08:19 -!- ehird`_ has changed nick to ehird`. 12:13:26 -!- Tritonio has quit (Remote closed the connection). 12:32:53 lament: w t f 12:35:22 -!- RodgerTheGreat has quit (Read error: 110 (Connection timed out)). 12:41:12 -!- sebbu2 has joined. 12:41:50 hi 12:48:35 -!- RodgerTheGreat has joined. 12:59:50 -!- sebbu has quit (Connection timed out). 13:01:24 * SimonRC has lunch. 13:10:12 erm 13:21:37 -!- pikhq has quit (Read error: 104 (Connection reset by peer)). 13:21:54 -!- pikhq has joined. 13:31:58 -!- oklopol has quit (Read error: 104 (Connection reset by peer)). 13:32:43 -!- oklopol has joined. 13:50:21 http://esolangs.org/wiki/BF_instruction_minimalization <<< @ notes, doesn't "; [<,>]@[<.>@]" loop endlessly @ input? 14:19:14 -!- jix has joined. 14:36:57 -!- RedDak has quit (Remote closed the connection). 14:41:01 eat clothespins 14:48:41 maybe eat clothespins nooga 14:48:49 Hmm... huh? 14:51:34 -!- jix has quit (Nick collision from services.). 14:51:45 -!- jix has joined. 15:19:12 -!- SEO_DUDE has joined. 15:19:44 a nooga is a delicacy in south mongolia 15:20:07 Rather like calamari. 15:22:55 My orders say I'm not supposed to know where I'm taking this boat, so I don't. But one look at you, and I know it's gonna be hot. 15:23:01 I'm going 75 clicks above the Do Lung bridge. 15:23:06 That's Cambodia captain. 15:23:12 That's classified. 15:46:13 I think the formatting language of my mpd client will be turing complete 15:46:24 You don't need loops to be turing complete, right? 15:54:19 if you run it on something superturing, it can be loopless 15:55:02 The interpreter is in python. 15:55:10 then i'd say no 15:55:17 :/ 15:55:24 It's a stack based language to format playlists, overkill? No 16:07:59 I think to be Turing complete, you have to be able to translate any Turing program into that language. 16:09:11 I'm not sure just how the resulting program has to act... 16:10:09 I think that if the original program halts, you must be able to find that out by running the resulting program, and if the original program halts, you must *not* be able to find that it halts by running the resulting program. 16:10:55 I'd like to see a description of this language. 16:29:14 sp3tt: loops are just something some imperative languages have. 16:29:57 i assumed he meant the concept of looping 16:30:11 and not an actual "while" etc. 16:33:16 i'm not sure in what sence does lambda calculus have "the concept of looping" 16:33:19 *sense 16:34:03 through an abstraction the programmer has created... 16:34:18 but i guess that might be a bad term for it. 16:36:10 i suppose in any language with side effects, you could define an "infinite loop" as something that performs some sequence of actions over and over again infinitely. 16:36:23 in that sense, you can have infinite loops in unlambda and haskell. 16:37:28 if your language can't do that, it's definitely not turing-complete. 16:38:37 hmm... so if you made unlambda return v instead everytime you're in an infinite loop, it wouldn't be turing complete? 16:38:52 i mean, theoretically speaking, since that's impossible to know 16:48:45 theoretically speaking, it's impossible 16:50:19 oklopol: no, the detection system would be superturing 16:50:39 ...orly 16:50:59 no, BECAUSE the detection system would be superturing? 16:51:03 is that what you meant? 16:51:11 oh 16:51:26 hmm... 16:52:02 indeed, that language would naturally be superturing 16:52:12 I was responding to "16:38:01 < oklopol> hmm... so if you" .... "it wouldn't be turing complete?" 16:53:22 because lament said, i think, that a language can't be turing complete if it can't loop infinitely 16:53:59 but i guess it can only either be less than tc, or superturing, if it does that 16:54:07 so he was right 17:06:02 * bsmntbombdood builds a halting oracle 17:10:20 3 17:11:25 sp3tt: mpd client.... commandline? qt? 17:19:14 baldsfkajsdlkfj!!KE@EN: 17:19:23 my geography class sucks 17:19:47 what's a major global problem facing our planet as we move into the 21st ccentury 17:20:17 humanity, we must kill off all humanity 17:20:35 oh damn 17:20:41 that's good 17:20:47 g4lt-sb100 is. 17:25:18 too many people 17:25:32 solution: less anthopology, more apthropophagy! 17:25:44 um 17:26:00 * anthropology 17:26:15 i need a reputable source that says that if i'm going to do it 17:28:02 the population bomb, written in 1968, by Paul Erlich. it states we should resort to cannibalism in like three or four years from now 18:23:50 Is there not enough food? 18:24:13 How is overpopulation a problem? 18:25:07 bsmntbombdood: is that a question for your geography class? 18:36:54 * SimonRC eats dinner. 18:37:01 ihope: what do you mean, how is overpopulation a problem 18:37:23 Is it a problem? 18:53:12 -!- GregorR has changed nick to behypercubed. 18:56:55 -!- behypercubed has changed nick to _D6Gregor1RFeZi. 19:41:13 -!- oerjan has joined. 21:13:13 -!- cherez has joined. 21:35:04 -!- SEO_DUDE has quit (Read error: 104 (Connection reset by peer)). 21:49:56 -!- SEO_DUDE has joined. 22:00:12 -!- jix has quit ("CommandQ"). 22:08:41 ihope: yeah 22:10:46 no! that cannot be! no way! 22:10:56 So how is it a problem? 22:11:12 ? 22:20:24 it's a problem because i have to answer it? 22:21:02 * ihope shrugs 23:00:54 -!- Tritonio has joined. 23:16:25 -!- Tritonio has quit (Read error: 104 (Connection reset by peer)). 23:19:41 -!- Tritonio has joined. 23:21:08 -!- SEO_DUDE has quit (Read error: 104 (Connection reset by peer)). 23:22:09 -!- ihope has quit (Read error: 110 (Connection timed out)).