JSVerbalExpressions
kbnf
JSVerbalExpressions | kbnf | |
---|---|---|
4 | 6 | |
12,167 | 0 | |
0.1% | - | |
7.8 | 0.0 | |
5 days ago | about 1 year ago | |
JavaScript | ||
MIT License | GNU General Public License v3.0 or later |
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.
JSVerbalExpressions
-
A portable, modern regular expression language
I agree with you. I got tired of fighting with regex where I got to the point of simply not using it if at all possible.
A comment further up offered a very promising alternative.
https://github.com/VerbalExpressions/JSVerbalExpressions#tes...
It's a bit verbose, but I don't care anymore, I am too much a veteran to care about my code being sleek, I want it readable and workable.
-
Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable
There is also VerbalExpressions with a somewhat similar idea
-
Regular expressions vs Me
JSVerbalExpressions — construct regular expressions with natural language terms
-
Super-expressive – Write regex in natural language
https://github.com/VerbalExpressions/JSVerbalExpressions
kbnf
- Ask HN: Please Review My Metalanguage
- Please Review My Metalanguage
-
A portable, modern regular expression language
The fundamental problem comes from assigning meaning to whitespace (in this case, concatenation). I had the same issues when developing KBNF ( https://github.com/kstenerud/kbnf/blob/master/kbnf.md ) which operates in a closely related space.
In early development, I took a number of cues from regex that turned out to be bad ideas, in particular using whitespace for concatenation (which all BNF dialects seem to do).
Switching to '&' for concatenation fixed it and made things a lot clearer, as it would also do for Pomsky:
'Hello' & ' '+ & ('world' | 'pomsky')
-
Ask HN: Please help me by reviewing KBNF
Hi everyone! Merry Christmas and happy new year!
I'm making a modernized BNF-style metalanguage that supports grammars for text and binary formats, but unless there's some kind of outside review, I won't find any blind spots I have until long after release.
If you have experience in grammars or protocols (text or binary), could you take a quick look?
Note: I'm not aiming for perfect expressivity; just 80-90% of use cases without making things overcomplicated so that it can be used descriptively in documentation.
https://github.com/kstenerud/kbnf/blob/master/kbnf.md
-
Social media may prevent users from reaping creative rewards of profound boredom
Boredom is what led to pretty much every project I've ever done. I usually have a list in my head of things that could be made better, but they never come to anything until I have a lengthy period of nothing to do.
Latest example: I had to take all my vacation time this year or else I'd lose it. I got so bored that I built this over the past weeks: https://github.com/kstenerud/kbnf
What are some alternatives?
melody - Melody is a language that compiles to regular expressions and aims to be more readable and maintainable
ReadingQuarkXpress - Some code to read certain Quark Xpress files
super-expressive - 🦜 Super Expressive is a zero-dependency JavaScript library for building regular expressions in (almost) natural language
rx - Standalone version of Emacs' rx macro
logstash-patterns - Grok patterns for parsing and structuring log messages with logstash
common-regex - Most common regex
ocaml-re - Pure OCaml regular expressions, with support for Perl and POSIX-style strings
ReadableRegex.jl - regexes for people who don't really want to learn or read regexes
fluent-plugin-grok-parser - Fluentd's Grok parser
hfst - Helsinki Finite-State Technology (library and application suite)
regex - Regex to parse translator