egg
pest
egg | pest | |
---|---|---|
25 | 42 | |
1,239 | 4,370 | |
2.7% | 1.3% | |
6.8 | 7.4 | |
10 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.
egg
-
An Introduction to Graph Theory
Maybe program optimization?
https://egraphs-good.github.io/
- The E-graph extraction problem is NP-complete
-
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?
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".)
-
What are the current hot topics in type theory and static analysis?
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.
-
Compiler Optimizations Are Hard Because They Forget
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!).
-
Modularity in IR representation and modification
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.
-
Any recommendations for good resources that show how algorithms and data structures are converted into fpga circuits
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.
-
Strategies for doing symbolic integration algorithmically
For rewriting, you may also find interesing equality saturation: https://egraphs-good.github.io/
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?
prose - Microsoft Program Synthesis using Examples SDK is a framework of technologies for the automatic generation of programs from input-output examples. This repo includes samples and sample data for the Microsoft Program Synthesis using Example SDK.
nom - Rust parser combinator framework
Symbolics.jl - Symbolic programming for the next generation of numerical software
lalrpop - LR(1) parser generator for Rust
Catlab.jl - A framework for applied category theory in the Julia language
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
Dagger.jl - A framework for out-of-core and parallel execution
chumsky - Write expressive, high-performance parsers with ease.
glow - Compiler for Neural Network hardware accelerators
pom - PEG parser combinators using operator overloading without macros.
StaticArrays.jl - Statically sized arrays for Julia
combine - A parser combinator library for Rust