[plt-scheme] What is all the fuss about how you can write DSLs in Lisp?

I think of this as a language feature, namely that you can add
features to the language.

Here is something that I think is not a DSL, using Scheme or Lisp to
write an interpreter.

On 6/7/07, Danny Yoo <dyoo at cs.wpi.edu> wrote:
> > That said, when I think of a DSL think about letting folks write
> > "programs" like:
> >
> > "trade 100 shares(x) when (time < 20:00) and timingisright()"
>
> Shriram's "Automata via Macros" paper has a nice example of a system for
> building finite state automata.
>
> http://www.cs.brown.edu/~sk/Publications/Papers/Published/sk-automata-macros/
>
> Does this fit what you're thinking of a DSL?
>