2024/05/24

Newest at the top

2024-05-24 03:48:03 +0200joeyadams(~joeyadams@2603:6010:5100:2ed:f314:a2aa:505f:509a) (Quit: Leaving)
2024-05-24 03:47:17 +0200tromp(~textual@92-110-219-57.cable.dynamic.v4.ziggo.nl)
2024-05-24 03:43:38 +0200nyc(~nyc@user/nyc) (Ping timeout: 252 seconds)
2024-05-24 03:41:41 +0200ystael(~ystael@user/ystael) (Ping timeout: 240 seconds)
2024-05-24 03:31:26 +0200lisbeths(uid135845@id-135845.lymington.irccloud.com) (Quit: Connection closed for inactivity)
2024-05-24 03:27:29 +0200L29Ah(~L29Ah@wikipedia/L29Ah) (Read error: Connection reset by peer)
2024-05-24 03:01:54 +0200nickiminjaj(~nickiminj@user/laxhh) (Quit: My MacBook has gone to sleep. ZZZzzz…)
2024-05-24 02:53:23 +0200raehik(~raehik@rdng-25-b2-v4wan-169990-cust1344.vm39.cable.virginm.net) (Ping timeout: 264 seconds)
2024-05-24 02:33:37 +0200joeyadams(~joeyadams@2603:6010:5100:2ed:f314:a2aa:505f:509a)
2024-05-24 02:32:47 +0200mud(~mud@user/kadoban) (Ping timeout: 272 seconds)
2024-05-24 02:29:46 +0200 <raehik> singling parsers*
2024-05-24 02:29:37 +0200 <raehik> set on this design with a small tweak to improve singling parser
2024-05-24 02:28:49 +0200 <raehik> to be clear this already all exists I'm just reconsidering things https://github.com/raehik/symparsec
2024-05-24 02:23:48 +0200mailman(~mailman@116.71.182.98) (K-Lined)
2024-05-24 02:23:44 +0200 <raehik> I'm trying to design a nice simple type-level parser combinator lib. I think I want simple parsers to be very boring, and complex ones (like decision) I don't mind being slow
2024-05-24 02:23:27 +0200FinnElija(~finn_elij@user/finn-elija/x-0085643)
2024-05-24 02:22:15 +0200 <raehik> glguy: true enough on yoctoparsec. I am lazy and was looking for concrete [Char] parsers
2024-05-24 02:20:16 +0200tomboy64(~tomboy64@user/tomboy64)
2024-05-24 02:20:05 +0200sawilagar(~sawilagar@user/sawilagar) (Ping timeout: 240 seconds)
2024-05-24 02:19:09 +0200mailman83(~mailman@116.71.182.98) (Client Quit)
2024-05-24 02:19:04 +0200Lord_of_Life(~Lord@user/lord-of-life/x-2819915)
2024-05-24 02:18:14 +0200mailman83(~mailman@116.71.182.98)
2024-05-24 02:17:36 +0200Lord_of_Life(~Lord@user/lord-of-life/x-2819915) (Ping timeout: 268 seconds)
2024-05-24 02:13:09 +0200mailman(~mailman@116.71.182.98)
2024-05-24 02:12:42 +0200FinnElija(~finn_elij@user/finn-elija/x-0085643) (Ping timeout: 260 seconds)
2024-05-24 02:12:26 +0200mailman(~mailman@116.71.182.98) (Quit: Client closed)
2024-05-24 02:11:52 +0200 <glguy> I did a version of ReadP a while back that had a nicer treatment of <++ that I think ReadP has https://github.com/glguy/breadth-first-parser-combinators/tree/master
2024-05-24 02:10:58 +0200 <glguy> You could rip out ReadP's biased choice operator, which would make the whole thing simpler to implement; kind of depends on what you're trying to do
2024-05-24 02:10:47 +0200Square(~Square4@user/square) (Ping timeout: 264 seconds)
2024-05-24 02:09:42 +0200 <glguy> (too many uses of type-level in that first fragment)
2024-05-24 02:09:14 +0200 <glguy> If you're ready to do type-level parser combinators at the type-level, you're ready to inline some type definitions to see what a simple case of yoctoparsec expands to
2024-05-24 02:07:11 +0200shoggouth(uid607148@user/shoggouth) (Quit: Connection closed for inactivity)
2024-05-24 02:06:48 +0200 <raehik> yoctoparsec is a bit too abstract for me to consider how it would look type-level
2024-05-24 02:06:44 +0200tomboy64(~tomboy64@user/tomboy64) (Ping timeout: 260 seconds)
2024-05-24 02:06:03 +0200 <raehik> glguy: Thanks for those. ReadP is more complex than I thought, 5 different result constructors
2024-05-24 01:57:46 +0200xff0x(~xff0x@2405:6580:b080:900:a0c9:53ff:d03b:8aee)
2024-05-24 01:55:50 +0200AlexNoo_(~AlexNoo@5.139.233.209)
2024-05-24 01:55:26 +0200AlexNoo_(~AlexNoo@5.139.233.209) (Read error: Connection reset by peer)
2024-05-24 01:54:33 +0200mailman(~mailman@116.71.182.98)
2024-05-24 01:54:24 +0200 <geekosaur> and you wouldn't be the first one to do so there
2024-05-24 01:54:12 +0200 <geekosaur> lisbeths, it's not against the rules but it's probably a better fit for #haskell-offtopic
2024-05-24 01:53:57 +0200 <glguy> https://hackage.haskell.org/package/base-4.20.0.0/docs/Text-ParserCombinators-ReadP.html is simpler than parsec
2024-05-24 01:53:23 +0200 <glguy> raehik: Super simple? there's https://hackage.haskell.org/package/yoctoparsec-0.1.0.0/docs/Control-Monad-Yoctoparsec.html
2024-05-24 01:44:55 +0200xff0x(~xff0x@2405:6580:b080:900:a0c9:53ff:d03b:8aee) (Ping timeout: 268 seconds)
2024-05-24 01:34:31 +0200mei(~mei@user/mei)
2024-05-24 01:32:07 +0200mei(~mei@user/mei) (Remote host closed the connection)
2024-05-24 01:28:50 +0200 <lisbeths> if this is a channel where it is against the rules to question the legitimacy of the University system then please ban me now
2024-05-24 01:22:46 +0200Tuplanolla(~Tuplanoll@91-159-69-59.elisa-laajakaista.fi) (Quit: Leaving.)
2024-05-24 01:21:53 +0200lisbeths(uid135845@id-135845.lymington.irccloud.com)
2024-05-24 01:20:13 +0200gmg(~user@user/gehmehgeh) (Quit: Leaving)