egglog | pest | |
---|---|---|
4 | 42 | |
337 | 4,370 | |
3.3% | 1.3% | |
9.5 | 7.4 | |
9 days ago | 5 days ago | |
Rust | Rust | |
MIT License | Apache License 2.0 |
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....
pest
-
nom > regex
And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop
-
Jasmine, A rust-like programming language that compiles to Java
I had recently completed the first year of my Computer Science class at school and will begin my second year soon. My schools' class forces the use of Java programming language, and I absolutely hated it. So, over the course of a little less than a month, I wrote my own programming language, in Rust (objectively best programming language), using pest, to be as similar to Rust as possible, but compiling to Java.
- Restoration of the pest3 work effort 🙌 · pest-parser/pest · Discussion #885
-
What is the state of the art for creating domain-specific languages (DSLs) with Rust?
I second pest.rs. Using it is fairly intuitive and there's also a live playground on their website which is great for quickly developing and testing your AST (abstract syntax tree) parser for whatever language you're implementing.
- pest v2.6.0 released with a new meta-grammar feature (node tags)
-
Finding a Crate to Help with Terminal Program Interface
This is where you'll run into trouble. People who write parsing-related Rust crates generally write things like pest that expect their syntax to be defined completely at compile time so the parser can be run through the compiler's optimizers for best performance.
-
easy way to produce a parser
Give https://pest.rs a try.
-
What is your opinion about lifetime of data generated from a parsing
For now I have used pest to generate an AST that borrows from the given input. But if I can manage to make the parser generic over the return type it may be worth a refactoring.
- Is there a parsing library (lexer?) which can handle generic tokens?
- v2.5.0: introducing `pest_debugger` · Discussion #739 · pest-parser/pest
What are some alternatives?
ezno - A JavaScript compiler and TypeScript checker written in Rust with a focus on static analysis and runtime performance
nom - Rust parser combinator framework
libclc - Cache Line Container - C11
lalrpop - LR(1) parser generator for Rust
scryer-prolog - A modern Prolog implementation written mostly in Rust.
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
flix - The Flix Programming Language
chumsky - Write expressive, high-performance parsers with ease.
yjs - Shared data types for building collaborative software
pom - PEG parser combinators using operator overloading without macros.
mpack - MPack - A C encoder/decoder for the MessagePack serialization format / msgpack.org[C]
combine - A parser combinator library for Rust