one-more-re-nightmare
oakc
Our great sponsors
one-more-re-nightmare | oakc | |
---|---|---|
11 | 3 | |
133 | 713 | |
0.8% | - | |
4.2 | 0.0 | |
9 months ago | over 1 year ago | |
Common Lisp | Rust | |
BSD 2-clause "Simplified" License | Apache License 2.0 |
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.
one-more-re-nightmare
-
Regular Expressions make me feel like a powerful wizard- that's not a good thing
Depends on your regex engine, and your non-regex solution. My engine (shameless self-plug https://github.com/telekons/one-more-re-nightmare) rivals hand-written automata, having to load each character more-or-less* only once, and throws in vectorisation for simple search loops too. I would not want to write or maintain the generated code.
-
Don't be lazy this month!
one-more-re-nightmare used to let you write Σ, but I then tried to search Greek stuff with it and it went wrong. So now there's...$ for all characters (since that's not used for end-of-line assertions).
-
When a young programmer who has been using C for several years is convinced that C is the best possible programming language and that people who don't prefer it just haven't use it enough, what is the best argument for Lisp vs C, given that they're already convinced in favor of C?
One trick is that Common Lisp can generate and compile code at runtime, whereas static languages typically do not have a compiler available at runtime. This lets you make your own lazy person's JIT/staged compiler, which is useful if some part of the problem is not known at compile-time. Such an approach has been used at least for array munging, type munging and regular expression munging.
-
Tutorial Series to learn Common Lisp quickly
> One of my favorite examples is the regex library cl-ppcre. Thanks to the nature of Lisp, the recognizer for each regex you create can be compiled to native code on compiler implementations of CL.
That is not true - cl-ppcre generates a chain of closures. Experimental performance is in the same ballpark as typical "bytecode" interpreting regex implementations.
(Disclosure: I wrote another regex library at <https://github.com/telekons/one-more-re-nightmare>, which does do native code compilation.)
-
The self-hosted Zig compiler can now successfully compile itself
Someone else didn't tell me that before, so it can't be true. But I don't publish papers on toys, nor do I think toy projects are awfully fast. Though the x86-64 backend I wrote was in someone else's repository and thus was several PRs :(
-
Most interesting languages to learn (from)?
Regular expressions
-
Is regex really fast in CL?
Also try this https://github.com/telekons/one-more-re-nightmare
-
Why You Should Learn Lisp In 2022?
A Common Lisp system has the compiler around at runtime, so if you can figure out how to profitably stage/specialise a computation, then you can roll your own cheap JIT of sorts. This can be useful for array munging and regular expressions at the least. You can do this in C, of course but you would need to use another compiler as a library (e.g. LLVM, TCC, libgccjit) or write your own (e.g. PCRE2's sljit).
-
LISP with GC in 436 bytes
Agree to disagree - I don't have the energy to remember operator precedence. One file from the regular expression compiler has most of the rewrite rules I read from the papers, except in S-expression syntax. There were a few bugs due to misreading precedence. Also c.f. Gerald Sussman talking about physics notation being a pain in the butt.
-
The one-more-re-nightmare regular expression compiler
It's all part of the library. Everything about regular expression types is in this file.
oakc
-
Most interesting languages to learn (from)?
This one
-
Harbor⚓- an esoteric language that ports: targeting your printer🖨️, UFO🛸, and kitchen sink🚰
Some of you might remember my project Free from about 2 years ago, and its successor Oak. This is a spiritual successor to both of these projects, and a bit of an attempt to showcase my improvement since learning from larger projects!
-
I wrote an interpreted functional programming language in Rust
Oof, looks like you've got an unfortunate name collision with the other oak language written in Rust.
What are some alternatives?
Revise.jl - Automatically update function definitions in a running Julia session
bfc - An industrial-grade brainfuck compiler
SICL - A fresh implementation of Common Lisp
java-2-times-faster-than-c - An inquiry into nondogmatic software development. An experiment showing double performance of the code running on JVM comparing to equivalent native C code.
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
bfc-rs - Brainfuck compiler for x86-64 Linux implemented in Rust.
cl-ppcre - Common Lisp regular expression library
Oak-Programming-Language - A small programming language
Petalisp - Elegant High Performance Computing
harbor - A language that ports⚓: examining the limits of compilation⚙️.
julia - The Julia Programming Language