rekex
PEG parser generator for Java 17 - grammar as algebraic datatypes (by zhong-j-yu)
rust-peg
Parsing Expression Grammar (PEG) parser generator for Rust (by kevinmehall)
| rekex | rust-peg | |
|---|---|---|
| 16 | 10 | |
| 53 | 1,396 | |
| - | - | |
| 0.0 | 3.6 | |
| over 2 years ago | 21 days ago | |
| Java | Rust | |
| Apache License 2.0 | 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.
rekex
Posts with mentions or reviews of rekex.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-09-27.
-
Java 17 Features: Pattern Matching for switch and Sealed Classes
My thoughts on these 3 kinds of datatypes - https://github.com/zhong-j-yu/rekex/blob/main/doc/Datatypes_Abstract_OOP_Algebraic.md
-
A new parser generator for Java 17, with grammar as algebraic datatypes
You don't need a separate grammar file. The set of datatypes defines the grammar. Take a look at the calculator exmample, the datatype Exp0 defines a grammar rule: Exp0 is one or more Exp1 separated by "+" or "-".
- The simplest way to write a parser
- Show HN: The Simplest Parser Generator
- Datatypes – Abstract, OOP, Algebraic
-
[Discussion] To use var or explicit typing
I also found it more pleasing to use var in a method with lots of local variables of a common type, see this example
-
A better way to construct regex
The parent project, https://github.com/zhong-j-yu/rekex , is a parser generator that mirrors grammar rules with datatypes. Since recursive types are not a problem, we don't have have a problem with recursive grammar rules.
- Show HN: Rekex – parser generator that derives grammar from parse tree datatypes
-
RegExp - structured regular expression
Here's how URI regex looks like using the API: https://github.com/zhong-j-yu/rekex/blob/main/rekex-example/src/main/java/org/rekex/exmple/regexp/ExampleRegExp_Uri.java
rust-peg
Posts with mentions or reviews of rust-peg.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-06.
-
nom > regex
And some related parser tools: - https://github.com/kevinmehall/rust-peg - https://github.com/pest-parser/pest - https://github.com/lalrpop/lalrpop
-
Letlang — Roadblocks and how to overcome them - My programming language targeting Rust
Rust is a very nice langage for implementing compilers, and has a nice ecosystem for it (logos, rust-peg, lalrpop, astmaker -- this one is mine --, etc...).
-
Is there a parsing library (lexer?) which can handle generic tokens?
My peg crate is a parser generator that supports arbitrary token types as input. See https://github.com/kevinmehall/rust-peg/blob/master/tests/run-pass/tokens.rs for an example.
-
Hey Rustaceans! Got a question? Ask here! (51/2022)!
The one rust parser-generator I used is PEG
-
Hey Rustaceans! Got a question? Ask here! (29/2022)!
The two parser generators that I am aware of are lalrpop and PEG. There both great, and have seen some use by languages that have been written in Rust.
-
Domain Specific Language embedded in Rust
rust-peg
- One Letter Programming Languages
-
Using Nom - a parser combinator library
I wanted to create a parser for Apertium Stream. In 2014, I used Whittle in Ruby. If this year were 2001, I would use Lex/Yacc. Anyway, this year is 2021. I wanted to create this parser in Rust. I tried to find what is similar to Lex/Yacc. I found Rust-Peg. I found a link to Nom from Rust-Peg's document. My first impression was Nom example is easy to read. At least, its document claimed Nom is fast.
-
Hey Rustaceans! Got an easy question? Ask here (5/2021)!
The peg crate has a resolved issue about this.
-
Rust is the second most used language for Advent of Code, after Python
I don't really know that much about parsing and grammars, other than what I've learned about regular languages and expressions and context-free languages in a standard Theory of Comp course from my university. I basically just learned peg by reading the Wikipedia article on PEGs, reading the crate documentation to understand the syntax, and then looking at some of the peg examples on their GitHub to understand how it works in practice.
What are some alternatives?
When comparing rekex and rust-peg you can also consider the following projects:
RRDiagram - Generate railroad diagrams from code or BNF, generate BNF from code
pest - The Elegant Parser
parboiled - Elegant parsing in Java and Scala - lightweight, easy-to-use, powerful.
nom - Rust parser combinator framework
autumn - A Java parser combinator library written with an unmatched feature set.
lalrpop - LR(1) parser generator for Rust
Calculator
chomp - A fast monadic-style parser combinator designed to work on stable Rust.
rust-bison-skeleton - Bison frontend for Rust
pom - PEG parser combinators using operator overloading without macros.
rust-csv - A CSV parser for Rust, with Serde support.
oak - A typed parser generator embedded in Rust code for Parsing Expression Grammars