[10:10:51] --> l33t_h4x0r (n=l33t_h4x@88-104-102-8.dynamic.dsl.as9105.com) has joined #haskell [10:10:53] i kno more about computas than u all im da best hacker eva [10:11:25] --- ChanServ sets modes [#haskell +o shapr] [10:12:05] <-- ex__nor has quit ("This computer has gone to sleep") [10:12:08] l33t_h4x0r: maybe you can write this for me then :) [10:12:18] wots that? [10:13:11] it shouldn't be that difficult, i just need to accept a line of text, then break it up into sections, [10:13:29] and the sections all have beginning and end signifiers [10:13:29] in wot lang? [10:13:35] haskell preferably [10:13:39] but i don't actually care [10:13:41] pfft =/ [10:13:47] i dun code lame languages.. kthx [10:13:58] well what language you wanna code it in? [10:14:12] ?elite i kno more about computas than u all im da best hacker eva [10:14:12] i use x86 asm for everythin [10:14:12] I KNO MOr3 A8OU7 COMPUT4z0rz tHAN U a11 i/\/\ d4 83zt HAckER e\/a [10:14:17] that's how you spell it [10:14:22] lmfao [10:14:32] :) [10:14:34] --> MarcWebe1 (n=marc@pD9E09EC3.dip.t-dialin.net) has joined #haskell [10:14:40] l33t_h4x0r: Would you rather use monads or arrows for parsers? [10:14:50] <-- MarcWeber has quit (Read error: 54 (Connection reset by peer)) [10:14:56] but to keep _lines_ of code to a minimum.. u cud use php's explode() [10:14:58] k so you think you can handle say making a sentance like "lo nanmu ku cu klama" into "lo nanmu ku" "cu klama" [10:14:58] go google it -_- [10:15:00] shapr: :) [10:15:11] --- MarcWebe1 is now known as MarcWeber [10:15:44] --- ChanServ sets modes [#haskell +o dons] [10:15:47] l33t_h4x0r: If you write x86 asm, how would you compare the instruction sets of the Itanium to the x86-64 extensions? [10:15:53] so if you had an app that would accept the string, and return just the strings say seperated by commas i'd like that [10:16:03] lokadin: Parser monad would do it for you. [10:16:42] as i say.. look into php's explode() .. then also count() and run a for loop to append each word with ',' [10:16:46] shapr: really? i was thinking it might but i can't begin to compredend how to use it. i'll go look at the docs some more .a'u [10:16:58] u can explode it using the space as a token [10:17:03] je'e [10:17:18] l33t_h4x0r: How would you handle backtracking? [10:17:48] shapr: Language.Haskell.Parser ? [10:17:52] Or what about ambiguous parses? [10:17:54] wot the fuck r u on shapr? [10:18:00] lmmfao [10:18:04] *sigh* [10:18:09] l33t_h4x0r: It's standard computer stuff, you know this, right? [10:18:23] maybe if uve had some professor teach u bullshit in uni yea [10:18:33] i learned on my own.. k.. i dun give a shit bout terms :p i just code [10:18:39] I've never had any computer classes. [10:18:42] I learned on my own also. [10:18:58] lokadin: Read the Parsec tutorial, it'll tell you how to create a parser. [10:19:00] I need your help ( http://rafb.net/paste/results/peiDJ028.html ) Line 56 makes trouble (see error at the bottom) I can't understand this error message as this line is working fine on line 39 [10:19:11] shapr: kk [10:19:13] l33t_h4x0r, which gets tripped first, #GP on cs limit violation or #PG on not present given the two apply to the same opcode position? [10:19:16] l33t_h4x0r: write a C++ compiler [10:19:19] lokadin: After that, you'll be able to turn the yacc grammar into a parsec parser. [10:19:24] * int-e thinks Itanium is a dead end - explicit parallelism is an interesting idea but a VLIW architecture isn't the right way to do it. [10:19:38] l33t_h4x0r: could you help me port GHC to the AVR architecture? [10:19:39] but we'll see :) [10:19:43] <-- l33t_h4x0r (n=l33t_h4x@88-104-102-8.dynamic.dsl.as9105.com) has left #haskell