Programming Language Design

Programming Language Design

Table of Contents

Chapter 1 - Syntax, Regular Languages and Regular Expressions
Chapter 2 - Finite Automata, Lexical Analysis
Chapter 3 - Designing Finite Automata, Eliminating Nondeterminism
Chapter 4 - Context-Free Languages, Parsing, Ambiguity
Chapter 5 - Eliminating Ambiguity, Recursive Descent Parsing
Chapter 6 - Precedence Climbing, Abstract Syntax Trees
Chapter 7 - Turing Machines
Chapter 8 - Decidability and the Halting Problem
Chapter 9 - Decidability of Regular Languages
Chapter 10 - Interpreters
Chapter 11 - Interpretation of functions and function calls
Chapter 12 - Why Clojure?
Chapter 13 - Clojure Data Structures
Chapter 14 - Clojure functions
Chapter 15 - Map, filter, reduce, and higher-order functions
Chapter 16 - Recursion and iteration
Chapter 17 - Clojure macros
Chapter 18 - Prolog
Chapter 19 - More Prolog
Chapter 20 - Virtual Machines
Chapter 21 - Erlang
Chapter 22 - Concurrency in Erlang
Chapter 23 - Concurrency in Clojure

Licenses and Attributions

Speak Your Mind

-->