Go to the first, previous, next, last section, table of contents.
- Compilers - Principles Techniques and Tools
-
The classic compiler text by
Aho, Sethi, and
Ullman commonly known as the
Red Dragon Book, or just Dragon Book. Highly recommended
for a substantive introduction to automata and parsing theory.
- Introduction to Automata Theory
-
Despite its self-declaration of triviality in the title, this one by
Hopcroft and Ullman is less introductory than others, if you ask me.
Still, it's a great book. The link above is to the second edition -- I
have the first edition that has a completely different graphic on the
cover. I can see why they changed it, but I kind-of wished they hadn't.
- Mastering Regular Expressions
-
While not a theoretical book, it is useful for practical learning about
how to write a regular expression.
- The Theory and Practice of Compiler Writing
-
This book by Jean-Paul
Tremblay and
Paul
Sorenson has a good alternate description of the DeRemer-Pennello LALR1
construction algorithm. Out of print, but you can probably find it at
your local univerity computer science library. Please tell me he didn't
actually shoot that beautiful animal.
- Lex & Yacc
-
A good overview of the classic lexer and parser compiler duo by
Levine, Mason, and Brown.
- Efficient Computation of LALR(1) look-ahead sets
-
F. L. DeRemer and T. Pennello, ACM Transactions on Programming Languages
and Systems, October 1982. The canonical reference to the LALR1
construction algorithm used by this parser generator. Note their
analysis of the relationship of SLR(1) and NQLALR(1) described in this
paper is flawed (see "On the (non-)Relationship between SLR(1) and
NQLALR(1) Grammars." M. E. Bermudez and K. M. Schimpf, ACM Transactions
on Programming Languages and Systems, April 1988).
Go to the first, previous, next, last section, table of contents.