Includes bibliographical references (pages 553-559) and index
pt I. Foundations. Mathematical preliminaries -- Languages -- pt. II. Context-free grammars and parsing. Context-free grammars -- Parsing; an introduction -- Normal forms -- pt. III. Automata and languages. Finite automata -- Regular languages and sets -- Pushdown automata and context-free languages -- Turing machines -- The Chomsky hierarchy -- pt. IV. Decidability and computability. Decidability -- Numeric computation -- Mu-recursive functions -- pt. V. Computational complexity. Computational complexity -- Tractability and NP-complete problems -- pt. VI. Deterministic parsing. LL(k) grammars -- LR(k) grammars -- Appendix I. Index of notation -- Appendix II. The Greek alphabet -- Appendix III. Backus-Naur definition of Pascal