<tt>> and I would suggest that we implement the racket matcher completely with syntax parse. > I usually argue for clarity of code over speed. BUT we must pay attention to performance, especially widely used features. > Have you measure the performance of the two versions? Indeed you really need to measure the performance impact of ripping out match from syntax-parse and of > > implementing match via syntax-parse. It doesn't seem a straightforward case for one or the other. > -- Matthias </tt> <tt>This is valid concerns, indeed. And you should see my implementation for list-no-order it's neat, simple and horribly inefficient.</tt> <tt>/Stefan</tt>