Post AYPj28LAKcc3uF5GDI by julia@snug.moe
 (DIR) More posts by julia@snug.moe
 (DIR) Post #AYPj28LAKcc3uF5GDI by julia@snug.moe
       2023-08-05T06:06:17.849Z
       
       0 likes, 0 repeats
       
       I don't think these basic combinators are good enough for this performance-critical part of my parser ​:02think:​Too much indirection, and the macros spit out shit that is way too verbose (85k lines 🥴)
       
 (DIR) Post #AYPj293peYLG8lyvpo by rq@borg.social
       2023-08-05T06:07:28.258Z
       
       0 likes, 0 repeats
       
       @julia@snug.moe yacc?
       
 (DIR) Post #AYPj29ZjjvrXjiuPZ2 by julia@snug.moe
       2023-08-05T06:11:57.418Z
       
       0 likes, 0 repeats
       
       @rq@borg.social nah, basically I want to make a Parser implementation that serves the same purpose as the regex in twemoji-parser.Rust doesn't have a compile-time regex crate (afaik), so this is the closest I can get.
       
 (DIR) Post #AYPj2ACjOx3Rgf9YLQ by Archivist@social.linux.pizza
       2023-08-05T07:46:34Z
       
       0 likes, 0 repeats
       
       @julia @rq... 85 thousand lines of generated code... I can fit almost 30 times my Turing complete scripting language in that. Heck I could compile to it by adding less than 1000 lines of code, with 2rds of them being a giant switch to handle arithmetic