swifties VS pl0c

Depends on the complexity of your queries, but if you have a narrow subset that you're interested in, implementing a recursive descent parser for just those parts of the syntax that fits your problem like a glove could be a better solution.

https://github.com/codr7/swifties

What few seem to realize is that it's perfectly possible to abstract out some of the work and create an extensible foundation for manual parsers.

Since it's all regular code, you can use the full power of the host language to deal with the problem.

https://github.com/codr7/swifties/blob/main/Sources/Swifties...

> Some compilers tokenize while parsing, but for a different reason: it's faster and uses less memory to generate the AST

And some don't even generate an AST. :) Just read in and emit or interpret.

https://briancallahan.net/blog/20210814.html

Single-pass compiler tutorial

Let's Write a Compiler

I don’t think there will be an AST. https://briancallahan.net/blog/20210814.html: “We will be writing a single-pass compiler for a simple language and immediately output our final output code as soon as our compiler has enough information to do so”

That “as soon as” implies code will be generated before the entire program has been parsed.

Also, for me single-pass implies “no AST”, as you would need at least one pass to construct one, and iterating over an AST counts as another pass for me.