lisp_eval_should_be ':a-keyword' ':a-keyword' 'keyword syntax reads and prints'
lisp_eval_should_be '(let ((a :foo) (b :foo)) (eq a b))' 'true' 'a keyword is eq to another keyword with the same name'
lisp_eval_should_be '(eval :foo)' ':foo' 'keywords evaluate to themselves'
lisp_eval_should_be '(mapcar keywordp '\''(:foo bar "baz"))' '(true false false)' 'keywordp'
lisp_eval_should_be '(keyword-name :abcde)' '"abcde"' 'keyword-name'

            } else if(match(input, /^[^][ 	('"`,;)@]+/)) # non-special chars

            } else if(match(input, /^:[^ \r\t\v\n('"`,;)@]+$/))         # keyword
                _push_token(substr(input, 1, RLENGTH), tokens, where)
            else if(match(input, /^[^][ 	('"`,;)@]+/)) # non-special chars

    } else if(this ~ /^:/) {
        ans = _keyword(substr(this, 2))

        else if(cell ~ /^k /) return ":" substr(cell,3)

(defintrinsic keywordp (a))
(defintrinsic keyword-name (a))

    _symbol("keywordp")
    _symbol("keyword-name")

    else if(car == _symbol("keywordp"))
        return _lispify_bool(_eval3(_cadr(form), env, env, d+1) ~ /^k /)
    else if(car == _symbol("keyword-name"))
        # this depends on the keyword's atom being "k somestuff"
        return _string(substr(_eval3(_cadr(form), env, env, d+1), 3))

}
function _keyword(s) {
    return "k " s

            else if(c ~ /^k /)  a[ia[1]++] = ":" substr(c,3)