egglog | nom | |
---|---|---|
4 | 85 | |
337 | 9,020 | |
3.3% | 0.9% | |
9.5 | 7.4 | |
9 days ago | 10 days ago | |
Rust | Rust | |
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
egglog
-
Towards a New SymPy
The herbie project using egraphs to explore different ways of rewriting floating point expressions. https://herbie.uwplse.org/ One can also write custom rulesets in egglog (a new egraph rewriting system / language / datalog) https://egraphs-good.github.io/egglog/?example=herbie
The approach is not yet anywhere near being able to touch all the domains sympy can handle. Destructive term rewriting tends to be a bit more forgiving to unsoundness in the rules and still returning roughly meaningful results. EGraph rewriting (and other automated reasoning systems) tend to just return junk as soon as you aren't careful about your semantics. Associativity and commutativity are ubiquitous in CAS applications and encoding these concepts in general purpose terms is rather unsatisfying. The post above emphasizes specialty methods for polynomials, which it would be desirable to find a clean way to integrate into egraph techniques. Variable binding (which is treated in a rather mangled form in CAS systems) is seemingly important for treating summation, differentiation, and integration correctly. The status of doing variable binding efficiently and correctly in egraphs is also unclear imo.
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
For semantic analyzers, check out egg and egglog. They're custom data structures for representing compiler rewrite rules in a non-destructive way.
-
Ask HN: What is new in Algorithms / Data Structures these days?
The recent work on relational, datalog-inspired egraphs in PLDI this year ("Unifying Datalog and Equality Saturation") is actually interesting because it can solve cases like the y/x*x -> y identity example, by the power of an interval analysis on x (among other things.) Sort of like adding a postulate but instead it's by adding relations between terms in the graph.
https://github.com/egraphs-good/egglog
https://arxiv.org/pdf/2304.04332.pdf
-
Better Together: Unifying Datalog and Equality Saturation
Close, but the link is on Page 13, and it points here: https://github.com/mwillsey/egg-smol
Unfortunately the naming is all a bit confusing, isn't it....
nom
-
Planespotting with Rust: using nom to parse ADS-B messages
Just in case you are not familiar with nom, it is a parser combinator written in Rust. The most basic thing you can do with it is import one of its parsing functions, give it some byte or string input and then get a Result as output with the parsed value and the rest of the input or an error if the parser failed. tag for example is used to recognize literal character/byte sequences.
-
Show HN: Rust nom parsing Starcraft2 Replays into Arrow for Polars data analysis
I may be the only one not familiar, but nom refers to https://github.com/rust-bakery/nom which looks like a pretty handy way to parse binary data in Rust.
-
Is this a good way to free up some memory?
Lots of people use nom for their parsing needs, but that's not the only game in town and there other options.
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
As much as I love nom as well as other parser combinator libraries, regex-based parsers, BNF/EBNF-based parsers, etc. I always end up going back to plain old text-based char-by-char scanners.
-
What's everyone working on this week (22/2023)?
I am using nom / nom_locate to build the parser side because I've done a handful of other projects with it, and I plan to use tower-lsp to hook up the language server side.
-
Tokenizing
Look into a parsing library such as https://github.com/rust-bakery/nom
-
Something like pydantic but for just strings?
If we were in /r/learnrust I'd have recommended the nom crate for this.
- Nom: Parser Combinators Library in Rust
-
lua bytecode parser written in rust
Thanks to the flexibility of [nom](https://github.com/rust-bakery/nom), it is very easy to write your own parser in rust, read [this article](https://github.com/metaworm/luac-parser-rs/wiki/Write-custom-luac-parser) to learn how to write a luac parser
-
Should I revisit my choice to use nom?
I've been working on an assembler and right now it uses nom. While nom isn't great for error messages, good error messages will be important for this particular assembler (current code), so I've been attempting to use the methods described by Eyal Kalderon in Error recovery with parser combinators (using nom).
What are some alternatives?
ezno - A JavaScript compiler and TypeScript checker written in Rust with a focus on static analysis and runtime performance
pest - The Elegant Parser
libclc - Cache Line Container - C11
lalrpop - LR(1) parser generator for Rust
scryer-prolog - A modern Prolog implementation written mostly in Rust.
combine - A parser combinator library for Rust
flix - The Flix Programming Language
pom - PEG parser combinators using operator overloading without macros.
yjs - Shared data types for building collaborative software
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
mpack - MPack - A C encoder/decoder for the MessagePack serialization format / msgpack.org[C]
chumsky - Write expressive, high-performance parsers with ease.