First, this is an old book. Second, there is still a lot to learn from this text given its age. Lexical analysis with finite state automata is well described. You will definitely understands syntax analysis with push down automata through BNF and the extensive discussion on grammars. Given q-grammars, LL(1) grammars you will understand selection sets and other criteria for deriving a genuine pushdown machine or the recursive descent model.
The use of tables and grammars for lexical and syntax analysis is extensive and the reader will be rewarded with their diligence. The use of Mini-BASIC in this text is not only nostalgic, but still relevant. It underscores the complexities of the day when languages came from the period of punch cards and things needed to be ordered with line numbers. I greatly appreciate this historical presentation. Even though the book was published in the 1970’s, it is still beneficial.
It will take some time to get through this book. The material is easy to digest, but understanding implementation, augmented stacks, and other details of BNF grammars will take the reader time to understand its application. It is build exactly like a textbook, so be ready for that.
At some point I will get to “Compilers: Principles, Techniques and Tools” by Aho, et al. That was released 10 years after this book, so looking forward to comparing the delivery methods.
(Also, I dogeared my book, which apparently makes me chaotic-evil in DND terms.)