According to TFA,
"No advanced mathematical knowledge is required; the book is based on an intuitive and engineering-like understanding of the processes involved in parsing, rather than on the set manipulations used in practice."
I'm guessing this drives the "practical" moniker.
A little googling uncovers a Second Edition, also available on pdf.
The thing is, the mathematics behind parsing, such as they are, are not complicated. The concepts of first and follow sets, if not their names, are required to see how grammars can be ambiguous for a simple LL or LALR parser. Set notation for formal definitions of state machines may be slightly daunting, but the intuitions are easily grasped from a few diagrams.
I'm probably too close to this domain to have a useful perspective for those not familiar with it though.
Completely disagree -- there are tons of parsing papers that are extremely notation-heavy and difficult to follow. Even other authors say so; this is from David Gries' 1972 paper "Describing an Algorithm by Hopcroft":
"In [3], Hopcroft gives an algorithm for minimizing the number of states in a finite automaton. [...] Unfortunately the algorithm, its proof of correctness and the proof of running time, are all very difficult to understand. We present here a "structured", top-down approach to the presentation of the algorithm which makes it much clearer. [...] Such a structured approach to presenting an algorithm seems to be longer and require more discussion than the conventional way. If the reader wishes to complain about this, he is challenged to first read Hopcroft's original paper and see whether he can understand it easily. The advantages of our approach will thus be clear."
And this is just a DFA minimization algorithm! It's not an undecidability proof or anything like that. And Hopcroft's original paper (PDF: ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/71/190/CS-TR-71-190.pdf) isn't nearly as dense or symbol-heavy as a lot of parsing papers out there.
There is a wide gap between reading papers that begin "A grammar G is a 4-tuple G=(N, sigma, P, S)" and are full of proofs and lemmas, and actually implementing algorithms.
A little googling uncovers a Second Edition, also available on pdf.