2 ms·If you've got those, then you're Turing-complete. I think that qualifies as more than an S-expression reader.by gjm11 17y agoIf you've got those, then you're Turing-complete. I think that qualifies as more than an S-expression reader.