mark-sweep
chumsky
mark-sweep | chumsky | |
---|---|---|
11 | 54 | |
702 | 3,334 | |
- | - | |
10.0 | 8.8 | |
almost 4 years ago | 6 days ago | |
C | Rust | |
GNU General Public License v3.0 or later | 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.
mark-sweep
-
Let's Write a Malloc
Never forget:
https://journal.stuffwithstuff.com/2013/12/08/babys-first-ga...
> Let me stress here that while this collector is simple, it isn’t a toy.
> There are a ton of optimizations you can build on top of this—in GCs and programming languages, optimization is 90% of the effort—but the core code here is a legitimate real GC.
> It’s very similar to the collectors that were in Ruby and Lua until recently.
> You can ship production code that uses something exactly like this.
> Now go build something awesome!
-
loxcraft: a compiler, language server, and online playground for the Lox programming language
Bob Nystrom also has a blog, and his articles are really well written (see his post on Pratt parsers / garbage collectors). I'd also recommend going through the source code for Wren, it shares a lot of code with Lox. Despite the deceptive simplicity of the implementation, it (like Lox) is incredibly fast - it's a great way to learn how to build production grade compilers in general.
-
The Garbage Collection Handbook, 2nd Edition
Bob Nystrom (of Game Programming Patterns, Crafting Interpreters, and dartfmt fame) also wrote a tutorial[1], of a precise as opposed to a conservative garbage collector.
Regarding register scanning, Andreas Kling has made (or at least quoted) an amusing observation[2] that your C runtime already has a primitive to dump all callee-save registers onto the stack: setjmp(). So all you have to do to scan registers is to put a jmp_buf onto the stack, setjmp() to it, then scan the stack normally starting from its address.
[1] https://journal.stuffwithstuff.com/2013/12/08/babys-first-ga...
[2] https://youtu.be/IzB6iTeo8kk
-
Ask HN: Do you recall any book or course that made a topic finally click?
- http://journal.stuffwithstuff.com/2013/12/08/babys-first-gar...
-
Garbage Collection with LLVM
Might not be that hard: https://journal.stuffwithstuff.com/2013/12/08/babys-first-garbage-collector/
- Baby’s First Garbage Collector (2013)
-
Reference Count, Don't Garbage Collect
To better understand garbage collection, nothing better than implementation. This article is such a joy to read:
https://journal.stuffwithstuff.com/2013/12/08/babys-first-ga...
chumsky
-
Lezer: A Parsing System for CodeMirror, Inspired by Tree-Sitter
I attempted to use this but was disheartened but the fact that it doesn't statically type node names. Tree Sitter doesn't either but it has much more of an excuse given that it targets C.
https://github.com/lezer-parser/lezer/issues/8
The dev seems mildly hostile to outside involvement too, so I moved on. These days I use Chumsky which is Rust rather than Typescript, but also way more awesome, if you can deal with the often incomprehensible compilation errors at least!
https://github.com/zesterer/chumsky
-
nom > regex
there’s also chumsky: https://github.com/zesterer/chumsky
-
Writing an Equation Solver
We are using technique called parser combinator. And we are using a library chumsky to write parser combinators.
-
loxcraft: a compiler, language server, and online playground for the Lox programming language
rust-langdev has a lot of libraries for building compilers in Rust. Perhaps you could use these to make your implementation easier, and revisit it later if you want to build things from scratch. I'd suggest logos for lexing, LALRPOP / chumsky for parsing, and rust-gc for garbage collection.
-
Examples of function-based parsers in chumsky? Examples of unit tests?
The examples that come with chumsky and the chumsky tutorial and guide all define their parsers using closures.
-
Flamingo - A start: the syntax, a soon-to-be-built keyword-less lang with flavoured code blocks. Seeking help and advice please :)
Parser: https://crates.io/crates/chumsky
-
pep-508 v0.2.1 - Zero copy Python dependency parser written with chumsky
chumsky's zero-copy rewrite has reached its first alpha release, and I have migrated my pep-508 parser to it, as suggested in my last announcement.
-
winnow = toml_edit + combine + nom
On my side, nom is still advancing well and a new major version is in preparation, with some interesting work a new GAT based design inspired from the awesome work on chumsky, that promises to bring great performance with complex error types. 2023 will be fun for parser libraries!
-
Rust implementation of Python dependency parser for PEP 508
I am using chumsky because I like the API, but it doesn't support zero copy at the moment. Although efficiency is good to have, it is not my primary good. This will probably get supported once chumsky implements support for it (see upstream issue).
-
Question about lexer and parser generators in Rust
Checkout https://github.com/zesterer/chumsky or https://github.com/rust-bakery/nom
What are some alternatives?
c-examples - Example C code
nom - Rust parser combinator framework
zig.vim - Vim configuration for Zig
pest - The Elegant Parser
mmtk-core - Memory Management ToolKit
pom - PEG parser combinators using operator overloading without macros.
git-from-the-bottom-up - An introduction to the architecture and design of the Git content manager
lalrpop - LR(1) parser generator for Rust
ixy-languages - A high-speed network driver written in C, Rust, C++, Go, C#, Java, OCaml, Haskell, Swift, Javascript, and Python
instaparse
rust-gc - Simple tracing (mark and sweep) garbage collector for Rust
combine - A parser combinator library for Rust