A case-like macro for regular expressions
I often find myself wanting a simple case
-like macro where the keys are regular expressions. regex-case
is an attempt at this.
I often find myself wanting a simple case
-like macro where the keys are regular expressions. regex-case
is an attempt at this.
My friend Zyni pointed out that someone has been getting really impressively confused and cross on reddit about empty lists, booleans and so on in Common Lisp, which led us to a discussion about what the differences between CL and Scheme really are here. Here’s a summary which we think is correct.
The various Stack Exchange sites, and specifically Stack Overflow, seem to be some of the best places for getting reasonable answers to questions on a wide range of topics from competent people. They would be a lot better if they were not so obsessed about closing duplicates.
What follows is an opinion. Do not under any circumstances read it. Other opinions are available (but wrong).
There are two laws.
slog
is a simple logging framework for Common Lisp based on the observation that conditions can represent log events.
Metatronic macros are a simple hack which makes it a little easier to write less unhygienic macros in Common Lisp.
It is the business of the future to be dangerous; and it is among the merits of science that it equips the future for its duties. — Alfred Whitehead
I’ve written two pattern matchers for Common Lisp:
destructuring-match
, or dsm
, is a case
-style construct which can match destructuring-bind
-style lambda lists with a couple of extensions;spam
, the simple pattern matcher, does not bind variables but lets you match based on assertions about, for instance, the contents of lists.Both dsm
and spam
strive to be simple and correct.
Yet another description of macroexpansion in Common Lisp. There is nothing particuarly new here and it partly duplicates some previous articles: I just wanted to rescue the text.