16
submitted 9 months ago* (last edited 9 months ago) by gerikson@awful.systems to c/notawfultech@awful.systems

Rules: no spoilers.

The other rules are made up as we go along.

Share code by link to a forge, home page, pastebin (Eric Wastl has one here) or code section in a comment.

you are viewing a single comment's thread
view the rest of the comments
[-] sailor_sega_saturn@awful.systems 6 points 9 months ago* (last edited 9 months ago)

Just when I think I'm out, awful systems pulls me right back in.

C++, Horrifying C++ for day 1b check it out ;)

Day 1: https://www.animeprincess.net/blog/?p=55

One day is enough for me though, writing deliberately off-the-wall code is surprisingly mentally taxing, and normally I make sure to never program outside of work.

[-] self@awful.systems 4 points 9 months ago

// Where we're going we won't need regexes.

fuck yes

[-] froztbyte@awful.systems 4 points 9 months ago

honestly I considered writing a parser-based approach

then I was too tired and thought "hmm, doing this with grok would be funny", but I didn't have logstash handy and fuck dealing with containers at midnight

I will, however, do that today

[-] froztbyte@awful.systems 3 points 9 months ago

Status report: grok allows for non-greedy matching but still captures greedily for term assignment. I think I have a workaround that might work (recursively pipe data back to itself, gated on length for action), need to test later

This particular flavour of parsecrime is near guaranteed to be of interest to very few, but I want to see if I can make it work nonetheless. That’s just how my brainworms work.

this post was submitted on 01 Dec 2023
16 points (100.0% liked)

NotAwfulTech

337 readers
1 users here now

a community for posting cool tech news you don’t want to sneer at

non-awfulness of tech is not required or else we wouldn’t have any posts

founded 1 year ago
MODERATORS