S Expression Interpreter

S-Expressions Interpreter

Overview

An s-expression interpreter reads parenthesized prefix notation (s-expressions), parses them into an internal representation, evaluates the resulting structure through a recursive eval-apply cycle, and prints the result. The same syntax represents both code and data — this property, called homoiconicity, is what enables Lisp-family languages to manipulate programs as data structures.

This skill covers three implementation approaches:

• Python interpreters — from 16-line proofs-of-concept to full implementations with function definitions, lexical scoping, and special forms
• C s-expression libraries — production parsing/manipulation (sfsexp) and educational heap-based lval structures with mpc parsing
• Language semantics — how Scheme, Common Lisp, and Clojure define functions, handle arguments, and evaluate expressions

When to Use

• Building a Lisp or Scheme interpreter from scratch in Python or C
• Implementing s-expression parsing without external lexer/parser libraries
• Adding lexical scoping and function definitions to an existing evaluator
• Understanding the eval-apply cycle that powers all Lisp implementations
• Integrating sfsexp for s-expression data handling in C/C++ programs
• Translating idioms between Python, Scheme, Common Lisp, and Clojure
• Studying how homoiconic languages separate reading from evaluation

Core Concepts

Homoiconicity: Code is data. The expression (+ 1 2) is simultaneously a computation (returns 3) and a data structure (a list of three elements). Interpreters exploit this by manipulating programs as lists before evaluating them.

S-expression structure: Every s-expression is either an atom (number, symbol, string) or a list of s-expressions in parentheses. This recursive definition represents any finite tree exactly.

Tokenization without lexers: Lisp's parenthesized syntax allows trivial tokenization — pad parentheses with whitespace and split. No complex lexer needed: input.replace('(', ' ( ').replace(')', ' ) ').split().

Recursive descent parsing: Walk the token stream, building nested lists on ( and returning atoms otherwise. The parser output is the AST — no separate transformation step required.

Eval-apply cycle: eval takes an expression and environment, returns a value. For procedure calls, it evaluates the operator and all arguments, then apply creates a new environment frame binding parameters to arguments and evaluates the body. This recursion continues until expressions reduce to atoms.

Lexical scoping: Functions capture the environment where they were defined. Environments form a chain of frames; variable lookup walks from innermost outward. This enables closures — functions that remember their defining context.

Special forms: Certain operators (if, define, lambda, and, or) do not evaluate all arguments before execution. They control evaluation order and must be handled as explicit cases in the evaluator.

Advanced Topics

Python Interpreter Implementations

• Minimal 16-line proof-of-concept: Ultra-concise tokenize→parse→eval pipeline for add/sub only → Minimal 16-Line Lisp in Python
• Minimal Scheme with comments: ~25 lines, bytegoblin pattern plus ; line comment support, four arithmetic ops → Minimal Scheme with Comments in Python
• Full Scheme with closures: Complete tokenize→parse→eval→REPL with ; comment support, SymbolTable scoping, closures, Scheme truth semantics → Full Scheme Interpreter in Python
• Full Lisp with defun/if/format: Complete interpreter with SymbolTable scoping, user-defined functions, recursion → Full Lisp Interpreter in Python
• Scheme with Lark parser: Modern grammar-based parsing, tuple data model, TDD workflow → Scheme Interpreter with Lark Parser

C S-Expression Implementations

• sfsexp production library: Continuation-based parser, linked-list sexp_t, embedded systems support → Small Fast S-Expression Library
• Build Your Own Lisp Ch. 9: lval struct with heap allocation, mpc parsing, pop/take helpers, eval-sexpr → S-Expressions in C — BYOL Chapter 9

Scheme Language Semantics

• Academic introduction: Expressions, compound values (cons/car/cdr), quoting, variadic functions, parameter passing modes → Introduction to Scheme — Functional Notes
• R4RS standard procedures: Boolean semantics, equivalence predicate tower (eq/eqv/equal/equalp?) → R4RS Standard Procedures Reference
• R7RS expression specification: Variable references, literals, procedure calls, lambda formal argument lists → R7RS Expression Types Specification

Common Lisp and Clojure Semantics

• Python→Common Lisp cheatsheet: Equality tower, sequence operations, hash-tables/alists/plists, LOOP macro, strings, regex, file I/O → Python to Common Lisp Cheatsheet
• Common Lisp functions: defun, funcall vs apply, multiple return values → Common Lisp Functions Guide
• Clojure functions: defn/fn, multi-arity, variadic with &, anonymous #(), Java interop → Clojure Functions Guide