WKHTMLToPDF VS egg

We’ll start with the WickedPDF gem, which is powered by the wkhtmltopdf command-line library.

The only “sane” way I’ve found to be able to deal with pdfs is through this tool https://wkhtmltopdf.org/

wget + https://wkhtmltopdf.org/

Thanks for the suggestion! KnpSnappyBundle was my initial way to go as well, but my pages use quite some Javascript (chartJs) to render and I couldn’t get wkhtmltopdf to work with it. As it seems wkhtmltopdf does not support ES6 https://github.com/wkhtmltopdf/wkhtmltopdf/issues/3596 so I was forced to find another way.

wkhtmltopdf — Generates PDFs from HTML documents.

Of the HTML-based pdf-engines pandoc supports, prince would have the best typography, but I don't like recommending Prince because it's proprietary and costs money. (I try to stick to open source when I can.) wkhtmltopdf is the fastest, but uses a pretty old codebase, and doesn't even support paged/print css. weasyprint is a little better in my experience, but still has a ways to go typographically. pagedjs-cli is just a wrapper around headless Chrome/Chromium, and while Chrome has made improvements with regard to typography, Google turns off some of those features (e.g., hyphens) in headless mode, which is annoying.

Concerning pdf there is the well known wkhtmltopdf , but let me say that I love the not so well known percollate

Did you try wkhtmltopdf and WeasyPrint, by any chance?

Since the srd uses standardized links (base/creature type/creature name) you could make a list of urls based on your selected monsters in a spreadsheet, then use a program like https://wkhtmltopdf.org/, https://www.weenysoft.com/free-html-to-pdf-converter.html, or the url conversion feature in Adobe Acrobat Pro if you combine all the urls into an htm for Acrobat to pull from.

Maybe program optimization?

https://egraphs-good.github.io/

For semantic analyzers, check out egg and egglog. They're custom data structures for representing compiler rewrite rules in a non-destructive way.

E-graphs are pretty awesome, and worth keeping in your back pocket. They're like union-find structures, except they also maintain congruence relations (i.e. if `x` and `y` are in the same set, then `f(x)` and `f(y)` must likewise be in the same set).

https://egraphs-good.github.io/

(Incidentally, union-find structures are also great to know about. But they're not exactly "new".)

I would add that Equality saturation/E-graphs has become quite a hot topic recently, since their POPL21 paper, with workshops dedicated to applications of e-graphs. They have even recently been added to Cranelift as an IR for optimizations.

Egraphs solve the rewrite ordering problem quite nicely. https://egraphs-good.github.io/

Note that one solution to this problem is to use equality saturation (which, coincidentally, has a great implementation in rust!).

Have you thought about trying to parallelize e-graphs? This way you can do a bunch of rewrite rules in parallel and then extract your desired graph at the end instead of having conflicts.

I think the equality saturation papers are a good start. A good start is egg. They have a presentation, a research paper and code you can play with. I think ultimately you want to translate arithmetic operations into logical operation that can be understood by the fpga. So I think it would be good to research how adders and multipliers are implemented in logic and ultimately include equalities between adders/multipliers with their logical counterpart. Note the this translation also depends on the representations of your numbers and their bit width.

For rewriting, you may also find interesing equality saturation: https://egraphs-good.github.io/