gram_grep
nom
gram_grep | nom | |
---|---|---|
4 | 85 | |
11 | 9,007 | |
- | 0.7% | |
7.1 | 6.5 | |
12 days ago | 7 days ago | |
C++ | Rust | |
Boost Software License 1.0 | 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.
gram_grep
-
AST-grep(sg) is a CLI tool for code structural search, lint, and rewriting
There is also gram_grep[0]"Search text using a grammar, lexer, or straight regex. Chain searches for greater refinement."
See also parsertl-playground[1] for online edit/test grammars.
[0]https://github.com/BenHanson/gram_grep
-
Show HN: Yacc/Lex editor/tester online
I'm building an online yacc/lex (LALR(1)) grammar editor/tester to help develop/debug/document grammars, the main repository is here https://github.com/mingodad/parsertl-playground and the online playground with several non trivial examples is here https://mingodad.github.io/parsertl-playground/playground/ .
Select a grammar/example from "Examples" select box and then click "Parse" to see a parser tree for the source in "Input source" editor.
It's based on https://github.com/BenHanson/gram_grep and https://github.com/BenHanson/lexertl14 .
Any feedback is welcome !
The grammars available so far (with varying state of correctness):
- Ada parser
- Question about lexer and parser generators in Rust
-
MSVC Backend Updates in Visual Studio 2019 version 16.10 Preview 2 | C++ Team Blog
Thanks for the tip, but I fear storing the result on the stack will be too much to ask for for big lexers (see https://github.com/BenHanson/gram_grep/blob/c64f8829661f11b38a55b42b37f5051c5eabfaa6/main.cpp#L2301 for example).
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?
frozen - a header-only, constexpr alternative to gperf for C++14 users
pest - The Elegant Parser
tracy - Frame profiler
lalrpop - LR(1) parser generator for Rust
gramatika - A minimal toolkit for writing parsers with Rust
combine - A parser combinator library for Rust
parsertl14 - C++14 version of parsertl
pom - PEG parser combinators using operator overloading without macros.
chumsky - Write expressive, high-performance parsers with ease.
rust-peg - Parsing Expression Grammar (PEG) parser generator for Rust
semgrep - Lightweight static analysis for many languages. Find bug variants with patterns that look like source code.