rekex
PEG parser generator for Java 17 - grammar as algebraic datatypes (by zhong-j-yu)
Calculator
By ciherrera20
| rekex | Calculator | |
|---|---|---|
| 16 | 1 | |
| 53 | 1 | |
| - | - | |
| 0.0 | 0.0 | |
| over 2 years ago | almost 2 years ago | |
| Java | Python | |
| 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
Calculator
Posts with mentions or reviews of Calculator.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-08-19.
-
A better way to construct regex
Ah interesting, not sure I entirely understand what you mean by an object graph. My project implements a recursive descent parser that allows for left recursion by curtailment. I think that's probably equivalent to what you're referring to as a cyclic object graph. Its basically a partial implementation of the algorithm described in this paper: Modular and Efficient Top-Down Parsing for Ambiguous Left-Recursive Grammars. You can check out the code here https://github.com/ciherrera20/Calculator.
What are some alternatives?
When comparing rekex and Calculator you can also consider the following projects:
RRDiagram - Generate railroad diagrams from code or BNF, generate BNF from code
parboiled - Elegant parsing in Java and Scala - lightweight, easy-to-use, powerful.
autumn - A Java parser combinator library written with an unmatched feature set.