In computer science, parsing is a big deal. They make it complicated, of course. But it shouldn't be. I developed a new approach to parsing which is implemented here. It is based on a simple stack of integers that are positions in what is effectively recursive descent parsing. I use this idea to compile Luan but also to parse JSON, Lucene queries, HTTP requests, BBCode, CSS, CSV, HTML, and other things.
When I wrote the JSON parser, it worked on the first run. It is so much simpler than any other JSON parser. I dare you to look for any JSON parser as simple as this one. All my other parsers are similar. My approach to parsing reflects my anti-modern values. I hate theoretical bullshit and I hate needless complexity. Think deeply about a problem (like parsing) until you see the essence of it. Then write clean simple code to solve the problem.
On Reddit my most negative karma is in /r/programming. This is reassuring because the more that modern scum hate me, the more sure I can be that I am on the right track. My post on this parser got a particularly negative response which shows how good this parser is. All modern programmers are vile human scum who hate everything good and love everything that is bad, so you can always verify the quality of your code by seeing how much modern scum programmers hate it. My parser passes this test with flying colors.
[–][deleted] (1 child)
[removed]
[–]fschmidt[S] 1 insightful - 1 fun1 insightful - 0 fun2 insightful - 0 fun2 insightful - 1 fun - (0 children)