I will be talking about material in Chapter 2 that explores many traditional ideas in lexing and parsing; I will also throw out some other ideas. In addition, if you like to watch video, there is a video at Microsoft that throws some interesting light on where Anders Hejlsberg is going with compilation.
Here's a link to see interesting comments from Rob Pike about using regular expressions in lexing.
Here's a link to some additional material on recursive descent and Scott's 2.15 "calculator language."
IEEE's 2025 list of popular languages
Redmonk Popularity Index for June 2025
Lambda the Ultimate (probably not useful except as a background)
2025-10-07: A webserver -- in COBOL
2025-10-07: Recursive Descent visualization for expressions
2025-10-14: "Why Study Programming Languages?"
2025-11-20: Daniel Okasaki's "Purely Functional Data Structures"
2025-11-20: The classic idiosyncratic introduction to Haskell
Obligatory xkcd:
