fluent-uri-rs
nom
fluent-uri-rs | nom | |
---|---|---|
1 | 85 | |
70 | 9,054 | |
- | 1.2% | |
9.2 | 7.4 | |
27 days ago | 3 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.
fluent-uri-rs
-
Annoucing fluent-uri: a fast, easy and strict URI parser
Hey all! Recently I've been working hard on this URI parser crate fluent-uri. It's the first crate that I'd ever wanted to publish on crates.io. But before doing that I'd like to receive some comments from you. It doesn't matter if the comments are about the design, structure, code or anything. I'd be grateful for any effort from you that helps make this project better. Thank you!
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?
kalem.rs - Fegeya Kalem.rs, Rust implementation of Kalem, work-in-progress.
pest - The Elegant Parser
vector - A high-performance observability data pipeline.
lalrpop - LR(1) parser generator for Rust
swc - Rust-based platform for the Web
combine - A parser combinator library for Rust
AppFlowy - AppFlowy is an open-source alternative to Notion. You are in charge of your data and customizations. Built with Flutter and Rust.
pom - PEG parser combinators using operator overloading without macros.
vector - A high-performance observability data pipeline. [Moved to: https://github.com/vectordotdev/vector]
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
chumsky - Write expressive, high-performance parsers with ease.
chomp - A fast monadic-style parser combinator designed to work on stable Rust.