melody
byteseek
| melody | byteseek | |
|---|---|---|
| 55 | 2 | |
| 4,594 | 38 | |
| - | - | |
| 4.3 | 0.0 | |
| 10 months ago | almost 3 years ago | |
| Rust | Java | |
| Apache License 2.0 | BSD 3-clause "New" or "Revised" 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.
melody
- nom > regex
- Melody 0.19.0 | A language that compiles to regular expressions and aims to be more readable and maintainable
- Melody 0.19.0 – A language that compiles to regular expressions
-
Yeah, we all know what you're good for...
just use Melody
-
I've created a Python module for constructing Regex patterns in a more computer programming-familiar way, so you don't have to re-learn Regex each time you use it!
How do you feel about projects such as melody?
-
Why does it have to be like this?
I found this beauty a while ago
-
Melody 0.18 (a sane alternative to regular expressions)
It's been a while since I updated you on Melody, wanted to share some of the improvements with you.
-
rulex VS melody - a user suggested alternative
2 projects | 19 Jun 2022
Melody is a language that compiles to regular expressions and aims to be more easily readable and maintainable
-
Regular expressions for humans
another project related to making regexes more readable: https://github.com/yoav-lavi/melody
-
Rulex – A new, portable, regular expression language
- https://github.com/yoav-lavi/melody - More verbose, supports macros, backslash escapes only for quotes. Rust compiler, babel plugin. Improves with time, getting quite impressive.
1 to 3 of match {
byteseek
-
Rulex – A new, portable, regular expression language
Interesting. It's very similar to a regex language I created for byte-oriented regular expressions [0]
Similar usability principles: delimitated strings, ignore whitespace, and comments.
[0] https://github.com/nishihatapalmer/byteseek/blob/master/synt...
-
Knuth-Morris-Pratt string-searching algorithm: DFA-less version
That was a fun read, I liked the use of cmbc to validate the algorithm.
For those who are interested, there's a good tool to specifically test string matching algorithms here:
https://github.com/smart-tool/smart
There are so many string matching algorithms now, with different best and worst cases. Some work better on low alphabets (eg DNA), so are better for text or high entropy data, some take advantage of CPU instructions, some are generic. The real challenge is picking the right algorithm.
I've implemented a few of them in java here, and extended them to support multi byte matching at any position:
https://github.com/nishihatapalmer/byteseek
What are some alternatives?
Fiber - ⚡️ Express inspired web framework written in Go
kleenexp - modern regular expression syntax everywhere with a painless upgrade path
pomsky - A new, portable, regular expression language
almson-regex - A simple library for writing readable regular expressions.
RegExr - RegExr is a HTML/JS based tool for creating, testing, and learning about Regular Expressions.
hgrep-smallcore - University project: Haskell implementation of https://www.ccs.neu.edu/home/turon/re-deriv.pdf, with a very small internal regex representation.
oil - Oils is our upgrade path from bash to a better language and runtime. It's also for Python and JavaScript users who avoid shell!
roman-arabic-calculator - This code is a proof of concept. The calculator can work with both Arabic (1,2,3,4,5 ...) and Roman (I, II, III, IV, V ...) numbers.
regex - Regex to parse translator
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.