swcl
Steel Wool Common Lisp (by no-defun-allowed)
one-more-re-nightmare
A fast regular expression compiler in Common Lisp (by telekons)
swcl | one-more-re-nightmare | |
---|---|---|
8 | 11 | |
8 | 133 | |
- | 0.0% | |
0.0 | 4.2 | |
20 days ago | 10 months ago | |
Common Lisp | Common Lisp | |
GNU General Public License v3.0 or later | BSD 2-clause "Simplified" 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.
swcl
Posts with mentions or reviews of swcl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-08-21.
-
Garbage Collection in a Large Lisp System (1984) [pdf]
related: the Immix inspired parallel-mark-region GC developed by Hayley Patton (https://github.com/no-defun-allowed/swcl) got merged recently into SBCL.
https://github.com/sbcl/sbcl/blob/master/doc/internals-notes...
https://applied-langua.ge/~hayley/swcl-gc.pdf
build with
./make.sh --without-gencgc --with-mark-region-gc (on x86-64/Linux and x86-64/macOS only at the moment).
-
SBCL: merge of mark-region GC
The Immix inspired mark-region GC developed by Hayley Patton (https://github.com/no-defun-allowed/swcl) got merged recently, which is pretty cool news for SBCL users.
-
ELS 2023 is today and tomorrow - and it's live on Twitch
Slides about the ongoing parallel garbage collector for SBCL: https://applied-langua.ge/~hayley/swcl-presentation.pdf (https://github.com/no-defun-allowed/swcl)
-
Garbage Collection benchmarks?
There is this document which details how the collector works.
-
Programming Language - Ranking
You want some steel wool for that, or...
-
Mini Lisp in under 1k lines of C: Cheney or mark-sweep GC, which is best?
I'm currently implementing Immix in SBCL (got generations working yesterday), but I wouldn't recommend one does that for a miniature implementation, as my implementation (though with hacks, performance tricks of dubious quality, and having to put the hysterical raisins somewhere) is about 1kLOC, and I haven't even gotten to writing compaction yet. A simple hybrid of mark-sweep and copying is the Lang-Dupont collector which copies one portion of the heap at a time, marking and reclaiming the rest in place.
-
Creator of SerenityOS announces new Jakt programming language
I say this while failing to design a parallel GC for SBCL for my second time; but I was unaware of the more clever RC schemes until recently, as nor myself nor my older colleagues seemed to have only used naive RC.
-
The self-hosted Zig compiler can now successfully compile itself
"the distributed system" is the first link, garbage collector is this link; again I wrote the backend for SICL as well as other parts, and I didn't say I made a language.
one-more-re-nightmare
Posts with mentions or reviews of one-more-re-nightmare.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-05-13.
-
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.