gisp

Uses Rob Pike's proven lexer design for fast and reliable tokenization, as mentioned in the README based on 'Lexical Scanning in Go'.

Implements TCO via loop/recur, enabling efficient recursion without stack overflow, which is critical for functional programming patterns in Lisp.

Generates Go Abstract Syntax Trees from Lisp code, allowing direct integration with Go's compilation pipeline for further processing or code generation.

Includes a built-in read-eval-print loop for immediate feedback, facilitating experimentation and rapid prototyping, as shown in the build instructions.