adventofcode
By yspreen
nom
Rust parser combinator framework (by rust-bakery)
adventofcode | nom | |
---|---|---|
11 | 85 | |
11 | 9,020 | |
- | 0.9% | |
8.6 | 7.4 | |
3 months ago | 7 days ago | |
Python | Rust | |
- | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-31.
-
[2022 day 19] after trying ever day for the last 11 days, nothing seems to work
I've tried this, didn't seem to help me much. I think this was the code
-
I'm really proud of solving this year, some close calls for giving up in there for sure! 18, 19, and 24 threw me for a loop. Thanks topaz for another great year 💙
repo
-
2021 day 18 part 2: test input works, real one doesn't.
full solution: https://github.com/yspreen/adventofcode/blob/main/2021/18/main.py
- -🎄- 2021 Day 16 Solutions -🎄-
-
5 / 6
All solutions @ yspreen/adventofcode
- 4 / 6
-
Day 14 2019
For part 2, I have one hint for you. I never could quite figure out how to handle spares and use them correctly. So I just ended up calculating decimals. As in, it requires 2.7 of material X. And then figuring out how to round later. Maybe this helps. My repo is https://github.com/yspreen/adventofcode
-
[2019 Day 7] Part two: Examples work, puzzle input does not
Okay, this bug hid extremely well. My extraction of opcodes from the input was faulty, and apparently only now did some edge-case catch that! Incredible. This is the fix commit: https://github.com/yspreen/adventofcode/commit/5edfa126b7176f2fa7776fe15eb4b4eff1386bb2
nom
Posts with mentions or reviews of nom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-10-28.
-
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?
When comparing adventofcode and nom you can also consider the following projects:
hello-world - Innocent first test.
pest - The Elegant Parser
AOC2021-in-Fortran - Advent of Code 2021 solutions in Fortran
lalrpop - LR(1) parser generator for Rust
adventofcode - Advent of code
combine - A parser combinator library for Rust
advent_of_code
pom - PEG parser combinators using operator overloading without macros.
advent-of-code - advent of code
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
advent-of-code - i know how to code now! here's my advent of code solutions that i can be somewhat proud of
chumsky - Write expressive, high-performance parsers with ease.